Here I am providing you the last year question paper of GATE Computer Science & Information Technology (CS) Exam

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
(A) 3 (B) 4 (C) 5 (D) 6

Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
(A) A(n) = Ω (W(n)) (B) A(n) = Θ (W(n))
(C) A(n) = O (W(n)) (D) A(n) = o (W(n))

The amount of ROM needed to implement a 4 bit multiplier is
(A) 64 bits (B) 128 bits (C) 1 Kbits (D) 2 Kbits

Register renaming is done in pipelined processors
(A) as an alternative to register allocation at compile time
(B) for efficient access to function parameters and local variables
(C) to handle certain kinds of hazards
(D) as part of address translation