GATE 2011 CS (CS1) – Previous Year Questions with Solutions
All 65 questions of GATE 2011 CS (CS1) with answers and explanations. Read each question, then practise it by topic or as a full paper.
Practise this paper in The GATE Grind →
- Question 1 – Choose the closest meaning of “inexplicable”.
- Question 2 – If log P = (1/2) log Q = (1/3) log R, which is true?
- Question 3 – I contemplated Singapore for my vacation but decided against it.
- Question 4 – If you are trying to make a strong impression on your audience, you cannot do so by being understated, tentative or .
- Question 5 – Choose the word most nearly opposite to “amalgamate”.
- Question 6 – Few school curricula include a unit on how to deal with bereavement and grief, and yet all students at some point in their lives suffer loss through…
- Question 7 – The chart shows four microbes. Circle diameter in parentheses represents growth of a surviving microbe within 24 hours. Danger is proportional to…
- Question 8 – Variable manufacturing cost is V=4q and fixed cost is F=100/q. How many units q minimize total V+F?
- Question 9 – A transporter receives the same daily orders and has an initial backlog. Seven trucks clear all orders by the end of day four; three trucks clear them…
- Question 10 – A container holds ten litres of pure spirit. Remove one litre and replace it with water, then repeat this mixture-removal/replacement twice more. How…
- Question 11 – A compiler recognizes language keywords during
- Question 12 – A layer-four firewall can inspect protocol headers through the transport layer. Which can it NOT do?
- Question 13 – Two fair coins are flipped. At least one outcome is known to be a head. What is the probability both are heads?
- Question 14 – Match email activities to application protocols: m₁ sends from mail client to mail server; m₂ downloads from mailbox server to mail client; m₃ checks…
- Question 15 – A product is maintained five years. With language L₁, development effort is LOC/10000 person-years, development cost ₹1000000 per person-year and…
- Question 16 – User-to-kernel mode switch time is t₁; switching between two processes takes t₂. Which is true?
- Question 17 – A digital signal-processing application has 40000 lines. Basic COCOMO for embedded software uses multiplicative factor 2.8 and exponent 1.20. Find…
- Question 18 – Which pair has different expressive power?
- Question 19 – Which action is not supported by pure HTML without client-side or server-side scripts?
- Question 20 – Which is NOT desired in a good software requirements specification?
- Question 21 – A computer receives interrupts from CPU overtemperature, mouse movement/button events, keyboard keys and completed hard-disk reads. Which has highest…
- Question 22 – A student table has one record per student: Registration Num unique per student; UID unique nationally per citizen; BankAccount Num is the primary…
- Question 23 – Which shown circuit is NOT equivalent to a two-input XNOR gate?
- Question 24 – Simplify (P+ Q+ R)(P+ Q+R)(P+Q+ R) to SOP.
- Question 25 – How many flip-flops are minimally required for a modulo-258 counter?
- Question 26 – An OS maintains smaller per-thread structures than per-process structures. Which statement is true?
- Question 27 – The drawings show complete graph K₄ and cube graph Q₃. Which is true?
- Question 28 – Let R=E[X2]-(E[X])2. Which always holds?
- Question 29 – Which machine model is necessary and sufficient for lexical analysis of a modern language such as Java?
- Question 30 – Page-fault service time is 10 ms; normal memory access is 20 ns. One fault occurs per 10⁶ accesses. Find effective access time.
- Question 31 – LW R1,20(R2) loads a 32-bit word at address 20+contents(R2) into R1. Which offered addressing mode does it use?
- Question 32 – What is printed?
- Question 33 – A max-heap has parent values at least their children’s values. Which displayed tree is a max-heap?
- Question 34 – P is regular and Q is context-free with Q⊆P, e.g. P=p*q* and Q=pⁿqⁿ:n∈N. Which is always regular?
- Question 35 – For A[0…n−1], define Lᵢ as the longest monotonically increasing run beginning at i. Set Lₙ₋₁=1 and for earlier i, Lᵢ=1+Lᵢ₊₁ if A[i]<A[i+1], otherwise…
- Question 36 – L 1=\0p1q:p,q N\, L 2=\0p1q:p,q N,p=q\, L 3=\0p1q0r:p,q,r N,p=q=r\. Which is NOT true?
- Question 37 – Binary operator ↓ has lower precedence than ↑. Operator ↑ is right-associative and ↓ left-associative. Which displayed parse tree represents…
- Question 38 – An interrupt routine on a sequential nonpipelined processor initializes an address register and count=500, then repeats: load byte from device; store…
- Question 39 – An unlabelled binary-tree shape has n nodes and n distinct keys are supplied. In how many ways can the keys populate it to make a BST?
- Question 40 – For positive integers x,y,z, define P(x)=(x=1) y[( z(x=yz))((y=x)(y=1))]. Which is correct?
- Question 41 – For i=-1, evaluate 0/2 x+i x x-i x\,dx.
- Question 42 – An integer table T(X,Y) initially contains (1,1). Let MX,MY be current maxima of its columns. Insert (MX+1,2MY+1), recomputing maxima each time, 128…
- Question 43 – A finite sequence X has mean μₓ and standard deviation σₓ. Define yᵢ=axᵢ+b for positive constants a,b. Which is incorrect?
- Question 44 – Five cards numbered one through five are shuffled. Draw two without replacement. What is the probability the first card’s number is exactly one higher…
- Question 45 – Processes P₀,P₁,P₂ have arrivals 0,1,2 ms and bursts 9,4,9 ms respectively. Use preemptive shortest-job-first, scheduling only at…
- Question 46 – Evaluate the shown expression tree on a load-store machine: memory holds a,b,c,d,e; binary operations use register operands and produce register…
- Question 47 – Find increasing asymptotic growth order for f 1(n)=2n, f 2(n)=n3/2, f 3(n)=n 2n, f 4(n)=n 2n.
- Question 48 – Matrices M₁,M₂,M₃,M₄ have dimensions p×q,q×r,r×s,s×t. With p=10,q=100,r=20,s=5,t=80, find minimum scalar multiplications.
- Question 49 – A large relation r has attributes A₁,…,Aₙ. Q₁ projects A₁,…,Aₙ after selecting Aₚ=c. Q₂ projects them after selecting c₁≤Aₚ≤c₂. Compare ordered…
- Question 50 – Find eigenvalues of pmatrix1&2&3\\0&4&7\\0&0&3pmatrix.
- Question 51 – Four pipeline stages take 5,6,11,8 ns. Registers between stages and after the last each add one ns. Under ideal steady-state conditions, find…
- Question 52 – Over alphabet a, L=\ank:k>0\, with fixed positive integer n. Find the smallest DFA state count.
- Question 53 – An 8 KB direct-mapped write-back cache has 32-byte blocks and 32-bit processor addresses. Metadata per line has one valid bit, one modified bit and…
- Question 54 – Loading 100 application libraries requires one disk access each. Seek time is 10 ms and rotation speed 6000 rpm. Locations are random; ignore…
- Question 55 – DFA D has transitions p:a→s,b→q; q:a→t,b→r; r loops on a,b; s,t are accepting and each loops on a,b. Which displayed DFA is an equivalent minimal…
- Question 56 – Loan Records(Borrower,Bank Manager,Loan Amount) contains (Ramesh,Sunderajan,10000),(Suresh,Ramgopal,5000),(Mahesh,Sunderajan,7000). Find the output.
- Question 57 – A quadratic-root routine handles four input classes: a=0, positive discriminant, zero discriminant, negative discriminant. It stores ordered real…
- Question 58 – Find foo(345,10).
- Question 59 – Find foo(513,2).
- Question 60 – The three D flip-flops form the shown counter. Immediately before a clock edge P,Q,R=0,1,0. Find PQR after the edge.
- Question 61 – All three flip-flops in the shown counter start zero. How many distinct PQR states are generated?
- Question 62 – A symmetric five-node distance-vector network has links N1–N2=1,N2–N5=3,N5–N4=4,N4–N3=2,N2–N3=6. Stable vectors in N1,…,N5 order are N1:(0,1,7,8,4),…
- Question 63 – A symmetric five-node distance-vector network has links N1–N2=1,N2–N5=3,N5–N4=4,N4–N3=2,N2–N3=6. Stable vectors in N1,…,N5 order are N1:(0,1,7,8,4),…
- Question 64 – An undirected graph has vertices v₁,…,vₙ, n>2. Vertices vᵢ,vⱼ are adjacent iff 0< i−j ≤2; edge weight is i+j. The drawing shows n=4. Find MST cost for…
- Question 65 – An undirected graph has vertices v₁,…,vₙ, n>2. Vertices vᵢ,vⱼ are adjacent iff 0< i−j ≤2; edge weight is i+j. The drawing shows n=4. For n=10, find…