GATE 2010 CS Solved Paper | GATE 2010 Computer Science Solved Paper | GATE Computer Science (CS) 2010 Paper

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

7. A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?
(A) 196 (B) 192 (C) 197 (D) 195

8. Consider a company that assembles computers. The probability of a faulty assembly of any computer is p. The company therefore subjects each computer to a testing process. This testing process gives the correct result for any computer with a probability of q. What is the probability of a computer being declared faulty?
(A) pq + (1 − p) (1 − q) (B) (1 − q)p (C) (1 − p) q (D) pq

Click Here For Download Full Paper

If you have questions, please ask below

90 thoughts on “GATE 2010 CS Solved Paper | GATE 2010 Computer Science Solved Paper | GATE Computer Science (CS) 2010 Paper

  1. m.chandrababu

    please send answers for it 2004,2005 and cse 2001,2002,2003,2004,21005,2006,2010 papers.please kindly urgent…….

  2. Prasant

    Please send me the question and answer sets of computer science and engineering that should be the GATE material from the year 2000 to 2010

    thanking u,

  3. shafiya

    sir, where could i find the solutions the gate cs papers, please provide solutions to the old cs papers or atleast key to them

  4. Pitu

    Plz send me last 10 years computer science gate question paper with solution.plz send me the name of the very good books for gate preparation of computer science….. Thank you very much…….

  5. shivam sharma

    please send me 10 years gate solved papers for IT.
    with regards,
    shivam sharma

  6. siurya

    sir i am doing mca i want to prepare for gate exam so what is the syllabus to me. The syllabus is for me and cs, it equal or not

  7. Amit

    Please send GATE -CS/IT Computer Science CS & IT Previous Question Papers with Answer.plz plz plz.thank u

  8. Amrita Bhattacharyya

    sir,plz send me gate computer sc. & engg.solved paper of 2007 to 2011.thank you very much.

  9. prasoon

    send me the fully solved all que papaer of gate cntaning it nd cs branch.plzz all de papers uregntly plzz


Leave a Reply