My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2009

Review the key details, then start the test when you are ready. You can also open the full package to see related papers.

Questions 60
Duration 180 mins
Package Computer Science & Information Technology (CS) - Previous Year Papers

Paper pattern & analysis

Filter this paper by subject, topic or subtopic. Every graph updates from the selected questions.

Explore previous papers
Showing all 60 questions in this paper.

Subject distribution

No subject classification is available.

Topic distribution

No topic classification is available.

Subtopic distribution

No subtopic classification is available.

Difficulty distribution

Easy 60 100%

Question type distribution

Multiple Choices 60 100%

Instructions

Computer Science & Information Technology (CS) 2009 – Instructions
  • Total number of questions: 60
  • 20 questions carry one mark each
  • 40 questions carry two marks each
  • Negative marking: 1/3 of the marks allotted to the question
  • Use of calculator is allowed
  • This is a proctored examination
  • All other browser applications will be automatically closed
  • After three warnings, the examination window will close automatically

Syllabus

Full Syllabus

Sample questions from this paper

Questions are selected across the paper subjects wherever the paper contains that variety.

1
2009 · Unclassified
Computer Science & Information Technology (CS) 2009
Q.1 – Q.20 carry one mark each.

Which one of the following is NOT necessarily a property of a Group?

A
Commutativity
B
Associativity
C
Existence of inverse for every element
D
Existence of identity
2
2009 · Unclassified
Computer Science & Information Technology (CS) 2009

What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n ≥ 2.

A
2
B
3
C
n−1
D
n
3
2009 · Unclassified
Computer Science & Information Technology (CS) 2009

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?

A
No two vertices have the same degree.
B
At least two vertices have the same degree.
C
At least three vertices have the same degree.
D
All vertices have the same degree.
4
2009 · Unclassified
Computer Science & Information Technology (CS) 2009

Consider the binary relation R = (x, y), (x, z), (z, x), (z, y) on the set x, y, z. Which one of the following is TRUE?

A
R is symmetric but NOT antisymmetric.
B
R is NOT symmetric but antisymmetric.
C
R is both symmetric and antisymmetric.
D
R is neither symmetric nor antisymmetric.
5
2009 · Unclassified
Computer Science & Information Technology (CS) 2009

(1217)8 is equivalent to

A
(1217)₁₆
B
(028F)₁₆
C
(2297)₁₀
D
(0B17)₁₆
6
2009 · Unclassified
Computer Science & Information Technology (CS) 2009

What is the minimum number of gates required to implement the Boolean function (AB + C) if we have to use only 2-input NOR gates?

A
2
B
3
C
4
D
5