My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2009 (1)

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 GATE & PSU 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

Medium 44 73.3%
Easy 10 16.7%
Hard 6 10%

Question type distribution

Multiple Choices 60 100%

Instructions

Demo Instruction

Syllabus

Sample

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 (1)
Which one of the following is NOT necessarily a property of a Group?
A
Commutativity
B
Existence of inverse for every element
C
Existence of identity
D
Associativity
2
2009 · Unclassified
Computer Science & Information Technology (CS) 2009 (1)
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
n – 1
C
n
D
3
3
2009 · Unclassified
Computer Science & Information Technology (CS) 2009 (1)
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
All vertices have the same degree.
D
At least three vertices have the same degree.
4
2009 · Unclassified
Computer Science & Information Technology (CS) 2009 (1)
Consider the binary relation on the set. 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 (1)
(1217)8 is equivalent to
A
(l217)16
B
(028F)16
C
(OB l7)16
D
(2297)10
6
2009 · Unclassified
Computer Science & Information Technology (CS) 2009 (1)
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
5
D
4