GATE Computer Science (CS) Question Paper Download 2012
GATE Computer Science (CS) Question Paper 2010
1.Which languages necessarily need heap allocation in the runtime environment?
(A) Those that support recursion (B) Those that use dynamic scoping
(C) Those that allow dynamic data structures (D) Those that use global variables
2. One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following statements best explains the need for this field?
(A) It can be used to prioritize packets
(B) It can be used to reduce delays
(C) It can be used to optimize throughput
(D) It can be used to prevent packet looping
3. Which one of the following is not a client server application?
(A) Internet chat (B) Web browsing (C) E-mail (D) Ping
4. Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
(A) L2 – L1 is recursively enumerable
(B) L1 – L3 is recursively enumerable
(C) L2 ∩ L1 is recursively enumerable
(D) L2 ∪ L1 is recursively enumerable
5. Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
(A) 1 (B) 2 (C) 3 (D) 4
6.Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
I. 2-phase locking
II. Time-stamp ordering
(A) I only (B) II only
(C) Both I and II (D) Neither I nor II
Tags: gate 2013 computer science solved paper dowmload, gate 2013 paper computer science, gate 2013 paper of cs and it branch, gate 2013 question paper download for cse, gate cse 2013 solved paper, gate paper 2013 cs branch, gate question for computer science branch in year 2012, how to succeeded in gate of CSE branch, importan question for cs branch