• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE-CS-2009

Question 1

Which one of the following in NOT necessarily a property of a Group?
  • Commutativity
  • Associativity
  • Existence of inverse for every element
  • Existence of identity

Question 2

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

  • n-1
     

  • 3
     

  • 2
     

  • n
     

Question 3

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

  • No two vertices have the same degree.

  • At least two vertices have the same degree.

  • At least three vertices have the same degree.

  • All vertices have the same degree.

Question 4

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?
  • R is symmetric but NOT antisymmetric
  • R is NOT symmetric but antisymmetric
  • R is both symmetric and antisymmetric
  • R is neither symmetric nor antisymmetric

Question 5

(1217)8 is equivalent to
  • (1217)16
  • (028F)16
  • (2297)10
  • (0B17)16

Question 6

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?
  • 2
  • 3
  • 4
  • 5

Question 7

A CPU generally handles an interrupt by executing an interrupt service routine
  • As soon as an interrupt is raised
  • By checking the interrupt register at the end of fetch cycle.
  • By checking the interrupt register after finishing the execution of the current instruction.
  • By checking the interrupt register at fixed time intervals.

Question 8

In which one of the following page replacement policies, Belady’s anomaly may occur?
  • FIFO
  • Optimal
  • LRU
  • MRU

Question 9

The essential content(s) in each entry of a page table is / are
  • Virtual page number
  • Page frame number
  • Both virtual page number and page frame number
  • Access right information

Question 10

What is the number of swaps required to sort n elements using selection sort, in the worst case? (A) \\theta(n) (B) \\theta(n log n) (C) \\theta(n^2 ) (D) \\theta(n^2 log n)
  • Theta(n)
  • Theta(nLogn)
  • Theta(n*n)
  • Theta(n*nLogn)

There are 60 questions to complete.

Last Updated :
Take a part in the ongoing discussion