The GATE Grind

GATE 2014 CS (CS3) – Previous Year Questions with Solutions

All 65 questions of GATE 2014 CS (CS3) with answers and explanations. Read each question, then practise it by topic or as a full paper.

Practise this paper in The GATE Grind →

  1. Question 1 (1 mark, Multiple choice) – “While trying to collect an envelope from under the table, Mr. X fell down and was losing consciousness.” The underlined phrases are I: “While trying…
  2. Question 2 (1 mark, Multiple choice) – If she how to calibrate the instrument, she done the experiment.
  3. Question 3 (1 mark, Multiple choice) – Choose the word opposite in meaning to “coherent”.
  4. Question 4 (1 mark, Multiple choice) – Which number does not belong in the series 2, 5, 10, 17, 26, 37, 50, 64?
  5. Question 5 (1 mark, Multiple choice) – An examination has no negative or partial marking. The question-wise data (question number, marks, answered correctly, answered wrongly, not…
  6. Question 6 (2 marks, Multiple choice) – A dance programme is scheduled for 10.00 a.m. Participating students must come an hour earlier and be accompanied by a parent. Other students and…
  7. Question 7 (2 marks, Multiple choice) – By the beginning of the 20th century, several hypotheses were being proposed, suggesting a paradigm shift in our understanding of the universe.…
  8. Question 8 (2 marks, Multiple choice) – GDP in rupees grew 7% during 2012–2013. For international comparison it is converted to USD at market exchange rates. During this period the exchange…
  9. Question 9 (2 marks, Multiple choice) – The graph gives male-to-female student ratios in a college for five years. If female enrolment in 2011 and 2012 is equal, find the ratio of male…
  10. Question 10 (2 marks, Multiple choice) – In (7526) 8-(Y) 8=(4364) 8, (X) N denotes X in base N. Find Y.
  11. Question 11 (1 mark, Multiple choice) – P: Good mobile phones are not cheap. Q: Cheap mobile phones are not good. L: P implies Q. M: Q implies P. N: P is equivalent to Q. Which is correct?
  12. Question 12 (1 mark, Multiple choice) – Let X,Y be finite sets and f:X Y. Which statement is TRUE?
  13. Question 13 (1 mark, Numerical answer) – A group G has 15 elements. L is a subgroup with L G and L 4. Find L .
  14. Question 14 (1 mark, Multiple choice) – Which statement is TRUE for every n × n matrix having only real eigenvalues?
  15. Question 15 (1 mark, Numerical answer) – V 1,V 2 are four-dimensional subspaces of a six-dimensional vector space V. Find the smallest possible dimension of V 1 V 2.
  16. Question 16 (1 mark, Numerical answer) – If 02 x x \,dx=k, find k.
  17. Question 17 (1 mark, Multiple choice) – F(P,Q,R,S)= m(0,2,5,7,8,10,13,15), with minterms 2,7,8,13 treated as don’t-cares. Find the minimal sum-of-products form.
  18. Question 18 (1 mark, Multiple choice) – A combinational block has Boolean inputs x,a,b and output y: f(x,y,a,b) if (x is 1) y = a; else y = b; Which digital block is most suitable?
  19. Question 19 (1 mark, Multiple choice) – Pipeline registers have zero latency. Stage latencies (ns) are P1: 1,2,2,1; P2: 1,1.5,1.5,1.5; P3: 0.5,1,1,0.6,1; P4: 0.5,0.5,1,1,1.1. Which processor…
  20. Question 20 (1 mark, Multiple choice) – A is an n × n square matrix. What does this pseudocode output? C = 100; for i = 1 to n do for j = 1 to n do Temp = A[i][j] + C; A[i][j] = A[j][i];…
  21. Question 21 (1 mark, Numerical answer) – Find the minimum arithmetic operations needed to evaluate P(X)=X5+4X3+6X+5 for given X, using only one temporary variable.
  22. Question 22 (1 mark, Multiple choice) – In the rooted tree shown, P is the root. In what order are the nodes visited during an in-order traversal?
  23. Question 23 (1 mark, Numerical answer) – Depth-first search starts at an unknown vertex of the graph shown. A recursive visit is made only after checking that the vertex has not been visited.…
  24. Question 24 (1 mark, Multiple choice) – Quicksort on n array elements always chooses the central array element as pivot. Find the tightest upper bound on worst-case performance.
  25. Question 25 (1 mark, Numerical answer) – Over =\a,b\, find the length of the shortest string NOT in the language of a*b*(ba)*a*.
  26. Question 26 (1 mark, Multiple choice) – Let be a finite nonempty alphabet and 2* the power set of *. Which is TRUE?
  27. Question 27 (1 mark, Multiple choice) – One purpose of intermediate code in compilers is to .
  28. Question 28 (1 mark, Multiple choice) – Which statements are correct? 1. Static allocation of all data areas by a compiler makes recursion impossible. 2. Automatic garbage collection is…
  29. Question 29 (1 mark, Multiple choice) – In modular software design, which combination is desirable?
  30. Question 30 (1 mark, Numerical answer) – A system uses three initially empty page frames and LRU replacement. Find total page faults for reference string 4,7,6,1,7,6,1,2,7,2.
  31. Question 31 (1 mark, Multiple choice) – Optimize A 1( A 2( F 1( F 2(r)))), where A 1 A 2 are attribute sets of r and F 1,F 2 are Boolean expressions on its attributes.
  32. Question 32 (1 mark, Multiple choice) – A prime attribute of relation schema R appears .
  33. Question 33 (1 mark, Multiple choice) – Which OSI layer/sub-layer and functionality pair is INCORRECT?
  34. Question 34 (1 mark, Multiple choice) – A bit-stuffing framing protocol uses delimiter 01111110. If the stuffed output is 01111100101, what was the input?
  35. Question 35 (1 mark, Multiple choice) – Host A in IPv4 network A sends datagram D to host B in IPv4 network B. Transmission is error-free. On arrival, which header fields may differ from D’s…
  36. Question 36 (2 marks, Numerical answer) – A CIDR router receives a packet for 131.23.151.76. Routing entries (prefix → output interface) are 131.16.0.0/12 → 3; 131.28.0.0/14 → 5; 131.19.0.0/16…
  37. Question 37 (2 marks, Numerical answer) – Every IPv4 host has a battery-backed, one-second-resolution real-time clock and a globally unique IPv4 address. Each must generate up to 1000 unique…
  38. Question 38 (2 marks, Multiple choice) – An IP router with MTU 1500 bytes receives a 4404-byte IP packet with 20-byte header. What are the relevant header fields of the third fragment?
  39. Question 39 (2 marks, Multiple choice) – Transactions: T1: r1(X); r1(Z); w1(X); w1(Z) T2: r2(Y); r2(Z); w2(Z) T3: r3(Y); r3(X); w3(Y) Schedules: S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y);…
  40. Question 40 (2 marks, Multiple choice) – Schemas: employee(empId,empName,empAge), dependent(depId,eId,depName,depAge). eId references empId; every employee has at least one associated…
  41. Question 41 (2 marks, Numerical answer) – Three programs each require three tape units. Find the minimum number of tape units that guarantees deadlocks never arise.
  42. Question 42 (2 marks, Numerical answer) – A preemptive OS uses shortest remaining time first. Process (arrival time, CPU burst), in ms: P1(0,12), P2(2,4), P3(3,6), P4(8,5). Find average…
  43. Question 43 (2 marks, Numerical answer) – A paging system has its entire page table and all pages in physical memory. TLB search takes 10 milliseconds and physical-memory access takes 80…
  44. Question 44 (2 marks, Multiple choice) – Basic block: a = b + c c = a + d d = b + c e = d - b a = e + b Find the minimum numbers of nodes and edges, respectively, in its DAG representation.
  45. Question 45 (2 marks, Multiple choice) – Which problem is undecidable?
  46. Question 46 (2 marks, Multiple choice) – Over =\0,1,c\, let L 1=\0n1n:n0\, L 2=\wcwr:w\0,1\*\, L 3=\wwr:w\0,1\*\, where wr reverses w. Which languages are deterministic context-free?
  47. Question 47 (2 marks, Numerical answer) – To move from 0 to 100 on the number line, each step moves right one unit or uses a prespecified shortcut (i,j), i < j, directly from i to j. At most…
  48. Question 48 (2 marks, Multiple choice) – 2CNFSAT consists of satisfiable propositional CNF formulas with at most two literals per clause; for example (x 1 x 2)(x 1x 3)(x 2 x 4). The decision…
  49. Question 49 (2 marks, Numerical answer) – A balanced BST T holds n numbers. To sum the m numbers between given L and H, the tightest upper bound is O(nabn+mcdn). Find a+10b+100c+1000d.
  50. Question 50 (2 marks, Multiple choice) – A 100-slot hash table resolves collisions by chaining. Under simple uniform hashing, find the probability that the first three slots remain empty…
  51. Question 51 (2 marks, Multiple choice) – An arbitrary tree uses leftMostChild–rightSibling representation. When its root is passed to DoSomething, what does the returned value count? typedef…
  52. Question 52 (2 marks, Multiple choice) – listA contains n > 0 elements sorted in ascending order. Which statement about ProcessArray is correct? int ProcessArray(int *listA, int x, int n) int…
  53. Question 53 (2 marks, Numerical answer) – A five-stage instruction pipeline has stages IF, ID/RF, EX, MEM, WB with latencies 1,2.2,2,1,0.75 ns. ID/RF is split into ID,RF1,RF2, each 2.2/3 ns,…
  54. Question 54 (2 marks, Numerical answer) – Memory access takes 1 ns for a cache-hit read, 5 ns for a cache-miss read, 2 ns for a cache-hit write and 10 ns for a cache-miss write. An instruction…
  55. Question 55 (2 marks, Multiple choice) – The synchronous JK flip-flop circuit shown starts with Q₂Q₁Q₀ = 000. Find the state sequence for the next three clock cycles.
  56. Question 56 (2 marks, Multiple choice) – For numerical evaluation of K= ab x2\,dx, where a and b are given, assess: I. The trapezoidal-rule value is always at least the exact integral. II.…
  57. Question 57 (2 marks, Multiple choice) – Evaluate 0 x2 x\,dx.
  58. Question 58 (2 marks, Numerical answer) – A and B are mutually exclusive events in sample space S with A B=S. Find the maximum of P(A)P(B).
  59. Question 59 (2 marks, Multiple choice) – Consider all f:\0,1,,2014\\0,1,,2014\ satisfying f(f(i))=i. P: Every such function fixes every i. Q: Every such function fixes some i. R: Every such…
  60. Question 60 (2 marks, Numerical answer) – A group (G,*) is generated by x,y, so every element is a product of x’s and y’s. Given x*x=y*y=x*y*x*y=y*x*y*x=e, where e is the identity, find the…
  61. Question 61 (2 marks, Multiple choice) – A forest G has n vertices and k connected components. How many edges does it have?
  62. Question 62 (2 marks, Multiple choice) – Let denote minimum vertex degree. For every planar graph on n vertices with 3, which is TRUE?
  63. Question 63 (2 marks, Multiple choice) – Which formula expresses “not all rainy days are cold”?
  64. Question 64 (2 marks, Multiple choice) – Schemas: employee(empId,empName,empDept), customer(custId,custName,salesRepId,rating). salesRepId references employee.empId. Each employee makes a…
  65. Question 65 (2 marks, Multiple choice) – With XOR denoted and binary constants 1,0, simplify F(P,Q)=((1 P)(P Q))((P Q)(Q0)).