GATE 2014 CS (CS2) – Previous Year Questions with Solutions
All 65 questions of GATE 2014 CS (CS2) 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 – Complete the sentence: “India is a post-colonial country because .”
- Question 2 – Who was coming to see us this evening?
- Question 3 – Match 1: eradicate; 2: distort; 3: saturate; 4: utilize with P: misrepresent; Q: soak completely; R: use; S: destroy utterly.
- Question 4 – Find the average of all multiples of 10 from 2 to 198.
- Question 5 – Evaluate 12+12+12+.
- Question 6 – The old city of Koenigsberg, with a German majority before World War 2, is now called Kaliningrad. After the war it became Russian territory with a…
- Question 7 – Dengue diagnoses in north India are twice last year’s number. Municipal authorities conclude mosquito-control measures have failed. Which statement,…
- Question 8 – For real x with x2-2x+3 =11, possible values of -x3+x2-x include .
- Question 9 – The line graph shows male-to-female student ratios over five years. If female enrolment doubled in 2009, by what percentage did male enrolment…
- Question 10 – Between 6 am and 7 am, which listed time gives the angle between minute and hour hands closest to 60°?
- Question 11 – An IT-office security system has 10 computers, exactly four working. Officials inspect four chosen uniformly without replacement. The system is deemed…
- Question 12 – Each of the nine words in “The quick brown fox jumps over the lazy dog” is written on a separate slip. A slip is drawn randomly from a box. Find…
- Question 13 – Find the maximum edges in a bipartite graph on 12 vertices.
- Question 14 – If A=pmatrix2\\-4\\7pmatrixpmatrix1&9&5pmatrix, find det(A).
- Question 15 – A nonzero degree-three polynomial f has roots 1, 2 and 3. Which must be TRUE?
- Question 16 – The dual FD of Boolean function F(x 1,,x n,+,,) swaps + and ·. F is self-dual when F=FD. How many self-dual functions of n Boolean variables exist?
- Question 17 – Let k=2n. An n-bit binary counter drives an n-to-2n decoder. This is equivalent to a .
- Question 18 – For (123)₅ = (x8)ᵧ, x and y are unknown. Find the number of possible solutions.
- Question 19 – A 4-way set-associative cache has capacity 16 KB and blocks of 8 words. Words are 32 bits and physical address space is 4 GB. Find TAG-field width…
- Question 20 – For the C function below, find func(435). int func(int num) int count = 0; while (num) count++; num >>= 1; return count;
- Question 21 – n and p are unsigned int in C. To set p to n choose 3 for large n, which is most likely correct?
- Question 22 – A max-heap priority queue initially has level order 10,8,5,3,2. Insert 1 then 7. Find the resulting level order.
- Question 23 – Which gives the solution of T(n)=2T(n/2)+ n, T(1) = 1?
- Question 24 – A BFS from W in an unweighted connected undirected graph gives tree T. T is a data structure for computing .
- Question 25 – Let L 1=\an:n0\ and L 2=\bn:n0\. I: L 1L 2 is regular. II: L 1L 2=\anbn:n0\. Which is correct?
- Question 26 – A mB means A is mapping (many-one) reducible to B. Which implication is FALSE?
- Question 27 – Grammar: S → T * P; T → U T * U; P → Q + P Q; Q → Id; U → Id. Which is TRUE?
- Question 28 – Which is NOT performed during compilation?
- Question 29 – Which one of the following is TRUE?
- Question 30 – A FAT file system has 4-byte entries. Disk size is 100 × 10⁶ bytes and data-block size 10³ bytes. Find maximum file size (units of 10⁶ bytes).
- Question 31 – Find the maximum number of superkeys of R(E,F,G,H) with E as the key.
- Question 32 – STUDENTS has rows (StudentID,StudentName,StudentEmail,StudentAge,CPI): (2345,Shankar,shankar@math,X,9.4), (1287,Swati,swati@ee,19,9.5),…
- Question 33 – Which statement about interior routing protocols RIP and OSPF is TRUE?
- Question 34 – Which socket API converts an unconnected active TCP socket into a passive socket?
- Question 35 – In the diagram, L1 is Ethernet and L2 is Token-Ring. An IP packet travels from S to R. Links within and across the two ISPs are point-to-point optical…
- Question 36 – A store-and-forward network A—R1—R2—B has bandwidth 10⁶ bytes/s on every link. A 10³-byte file is sent three ways: one packet (time T₁), 10 equal…
- Question 37 – Q reaches HTTP server H through Q—R1—R2—R3—H and downloads a file. DES shared-key encryption is at session layer. I1: Downloaded file URL; I2: TCP…
- Question 38 – A graphical HTML browser at Q fetches a static HTML page from HTTP server S. The page has exactly one static embedded image, also at S. With no…
- Question 39 – For the shown schedule S of T1, T2, T3 and T4, which statement is correct?
- Question 40 – A nested-loop relational join of r(R) and s(S) uses three disk-block-sized buffers, one reserved for results. If size(r) < size(s), disk accesses are…
- Question 41 – Producer–consumer uses semaphores n = 0 and s = 1. producer: repeat forever produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n);…
- Question 42 – Processes A,B,C each run 100 iterations, each consisting of t c CPU time followed by t io I/O time. They have separate I/O devices; OS overhead is…
- Question 43 – Twenty page frames initially contain pages 101–120. A program accesses 1,2,…,100 in order, repeating this sequence thrice. Which replacement policy…
- Question 44 – A compiler generates this for C access X[i][j][k], with 32-bit int and 8-bit char: t0 = i * 1024 t1 = j * 32 t2 = k * 4 t3 = t1 + t0 t4 = t3 + t2 t5 =…
- Question 45 – Let M encode a Turing machine over 0,1. Let L=\ M:M accepts a string of length 2014\. L is .
- Question 46 – L₁ consists of binary strings with at least as many occurrences of 110 as of 011. L₂ consists of binary strings with at least as many occurrences of…
- Question 47 – A = “qpqrr”, B = “pqprqrp”. Let x be their longest common subsequence length (not necessarily contiguous), and y the number of such longest common…
- Question 48 – Sorted sequences P,Q,R,S,T have lengths 20,24,30,35,50. Merge them into one by merging two sequences at a time. Find worst-case comparisons for an…
- Question 49 – Each leaf of the shown expression tree independently has value 0 or 1. Find the maximum value of the expression over all leaf assignments.
- Question 50 – Consider: double f(double x) if (abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); Give q to two decimals such that f(q) returns q.
- Question 51 – A stack supports REVERSE (reverses all elements) in addition to PUSH and POP. Which is TRUE?
- Question 52 – Consider the C function: int f(int j) static int i = 50; int k; if (i == j) printf("something"); k = f(i); return 0; else return 0; Which is TRUE?
- Question 53 – Which statement about cache-block size is correct?
- Question 54 – Cache associativity doubles while capacity and block size stay fixed. Which is guaranteed unaffected?
- Question 55 – IEEE-754 single precision uses 1 sign bit, 8 biased-exponent bits and 23 fraction bits. Float X = −14.25. Find its hexadecimal representation.
- Question 56 – Newton–Raphson starts at x 0=2 for 0.75x3-2x2-2x+4=0. I: x 3=0. II: The method converges to a solution in finitely many iterations. Which is TRUE?
- Question 57 – Find the product of nonzero eigenvalues of pmatrix1&0&0&0&1\\0&1&1&1&0\\0&1&1&1&0\\0&1&1&1&0\\1&0&0&0&1pmatrix.
- Question 58 – Find probability that a positive integer chosen uniformly from 1–100 inclusive is NOT divisible by 2, 3 or 5.
- Question 59 – Find the number of distinct positive integer factors of 2014.
- Question 60 – S is the set of integers from 1 to 2014. For distinct subsets U,V, define U < V when the minimum element of their symmetric difference belongs to U.…
- Question 61 – A cycle on n vertices is isomorphic to its complement. Find n.
- Question 62 – Find the number of distinct minimum spanning trees of the weighted graph shown.
- Question 63 – Which Boolean expression is NOT a tautology?
- Question 64 – SQL allows duplicate tuples and multiplicities in joins. Which query always gives the same result as “select * from R where a in (select S.a from S)”?
- Question 65 – Eight memory modules share a one-word-wide bus. A write occupies the bus for 100 ns with data, address and control. The addressed module is busy for…