The GATE Grind

GATE 2016 CS – Previous Year Questions with Solutions

All 65 questions of GATE 2016 CS 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) – Out of the following four sentences, select the most suitable sentence with respect to grammar and usage.
  2. Question 2 (1 mark, Multiple choice) – A rewording of something written or spoken is a .
  3. Question 3 (1 mark, Multiple choice) – Archimedes said, "Give me a lever long enough and a fulcrum on which to place it, and I will move the world." The sentence above is an example of a…
  4. Question 4 (1 mark, Multiple choice) – If 'relftaga' means carefree, 'otaga' means careful and 'fertaga' means careless, which of the following could mean 'aftercare'?
  5. Question 5 (1 mark, Multiple choice) – A cube is built using 64 cubic blocks of side one unit. After it is built, one cubic block is removed from every corner of the cube. The resulting…
  6. Question 6 (2 marks, Multiple choice) – A shaving set company sells 4 different types of razors, Elegance, Smooth, Soft and Executive. Elegance sells at Rs. 48, Smooth at Rs. 63, Soft at Rs.…
  7. Question 7 (2 marks, Multiple choice) – Indian currency notes show the denomination indicated in at least seventeen languages. If this is not an indication of the nation's diversity, nothing…
  8. Question 8 (2 marks, Multiple choice) – Consider the following statements relating to the level of poker play of four players P, Q, R and S. I. P always beats Q II. R always beats S III. S…
  9. Question 9 (2 marks, Multiple choice) – If f(x) = 2x7 + 3x - 5, which of the following is a factor of f(x)?
  10. Question 10 (2 marks, Multiple choice) – In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of 80 units, it takes 100 cycles for…
  11. Question 11 (1 mark, Numerical answer) – Let p, q, r, s represent the following propositions. p: x \8, 9, 10, 11, 12\ q: x is a composite number r: x is a perfect square s: x is a prime…
  12. Question 12 (1 mark, Multiple choice) – Let a n be the number of n-bit strings that do NOT contain two consecutive 1s. Which one of the following is the recurrence relation for a n?
  13. Question 13 (1 mark, Numerical answer) – x 4 (x - 4)x - 4 = .
  14. Question 14 (1 mark, Numerical answer) – A probability density function on the interval [a, 1] is given by 1/x2 and outside this interval the value of the function is zero. The value of a is…
  15. Question 15 (1 mark, Numerical answer) – Two eigenvalues of a 3 3 real matrix P are (2 + -1) and 3. The determinant of P is .
  16. Question 16 (1 mark, Multiple choice) – Consider the Boolean operator \# with the following properties: x \# 0 = x, x \# 1 = x, x \# x = 0 and x \# x = 1. Then x \# y is equivalent to
  17. Question 17 (1 mark, Numerical answer) – The 16-bit 2's complement representation of an integer is 1111 1111 1111 0101; its decimal representation is .
  18. Question 18 (1 mark, Numerical answer) – We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to…
  19. Question 19 (1 mark, Numerical answer) – A processor can support a maximum memory of 4 GB, where the memory is word-addressable (a word consists of two bytes). The size of the address bus of…
  20. Question 20 (1 mark, Multiple choice) – A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is…
  21. Question 21 (1 mark, Numerical answer) – Consider the following directed graph: [Directed graph on vertices a, b, c, d, e, f with edges a→b, b→c, c→f, a→d, d→e, e→f.] The number of different…
  22. Question 22 (1 mark, Multiple choice) – Consider the following C program. Which one of the following expressions, when placed in the blank above, will NOT result in a type checking error?
  23. Question 23 (1 mark, Multiple choice) – The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
  24. Question 24 (1 mark, Multiple choice) – Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of…
  25. Question 25 (1 mark, Numerical answer) – Consider the following C program. The output of the program is .
  26. Question 26 (1 mark, Multiple choice) – Which of the following languages is generated by the given grammar? S aS bS
  27. Question 27 (1 mark, Multiple choice) – Which of the following decision problems are undecidable? I. Given NFAs N 1 and N 2, is L(N 1) L(N 2) = ? II. Given a CFG G = (N, , P, S) and a string…
  28. Question 28 (1 mark, Multiple choice) – Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive…
  29. Question 29 (1 mark, Numerical answer) – Consider the following code segment. The minimum number of *total* variables required to convert the above code segment to *static single assignment*…
  30. Question 30 (1 mark, Multiple choice) – Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the…
  31. Question 31 (1 mark, Multiple choice) – Which of the following is NOT a superkey in a relational schema with attributes V, W, X, Y, Z and primary key VY?
  32. Question 32 (1 mark, Multiple choice) – Which one of the following is NOT a part of the ACID properties of database transactions?
  33. Question 33 (1 mark, Multiple choice) – A database of research articles in a journal uses the following schema. (Volume, Number, StartPage, EndPage, Title, Year, Price) The primary key is…
  34. Question 34 (1 mark, Multiple choice) – Which one of the following protocols is NOT used to resolve one form of address to another one?
  35. Question 35 (1 mark, Multiple choice) – Which of the following is/are example(s) of stateful application layer protocols? (i) HTTP (ii) FTP (iii) TCP (iv) POP3
  36. Question 36 (2 marks, Numerical answer) – The coefficient of x12 in (x3 + x4 + x5 + x6 + )3 is .
  37. Question 37 (2 marks, Numerical answer) – Consider the recurrence relation a 1 = 8, a n = 6n2 + 2n + a n-1. Let a 99 = K 104. The value of K is .
  38. Question 38 (2 marks, Numerical answer) – A function f : N+ N+, defined on the set of positive integers N+, satisfies the following properties: f(n) = f(n/2) if n is even f(n) = f(n+5) if n is…
  39. Question 39 (2 marks, Numerical answer) – Consider the following experiment. Step 1. Flip a fair coin twice. Step 2. If the outcomes are (TAILS, HEADS) then output Y and stop. Step 3. If the…
  40. Question 40 (2 marks, Multiple choice) – Consider the two cascaded 2-to-1 multiplexers as shown in the figure. [Figure: The first 2-to-1 MUX has input 0 tied to 0, input 1 tied to R, and…
  41. Question 41 (2 marks, Numerical answer) – The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 kilobytes from disk to main…
  42. Question 42 (2 marks, Numerical answer) – The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage (with delay 800 picoseconds) is replaced with a…
  43. Question 43 (2 marks, Multiple choice) – Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder…
  44. Question 44 (2 marks, Multiple choice) – The following function computes the maximum value contained in an integer array `p[]` of size n (n 1). The missing loop condition is
  45. Question 45 (2 marks, Multiple choice) – What will be the output of the following C program?
  46. Question 46 (2 marks, Multiple choice) – What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed?
  47. Question 47 (2 marks, Multiple choice) – An operator `delete(i)` for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in…
  48. Question 48 (2 marks, Numerical answer) – Consider the weighted undirected graph with 4 vertices, where the weight of edge \i, j\ is given by the entry W ij in the matrix W. W = bmatrix 0 & 2…
  49. Question 49 (2 marks, Numerical answer) – Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum…
  50. Question 50 (2 marks, Multiple choice) – G = (V, E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements…
  51. Question 51 (2 marks, Numerical answer) – Let Q denote a queue containing sixteen numbers and S be an empty stack. Head(Q) returns the element at the head of the queue Q without removing it…
  52. Question 52 (2 marks, Multiple choice) – Consider the following context-free grammars: G 1: S aS B, B b bB G 2: S aA bB, A aA B , B bB Which one of the following pairs of languages is…
  53. Question 53 (2 marks, Multiple choice) – Consider the transition diagram of a PDA given below with input alphabet = \a, b\ and stack alphabet = \X, Z\. Z is the initial stack symbol. Let L…
  54. Question 54 (2 marks, Multiple choice) – Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y reduces to W, and…
  55. Question 55 (2 marks, Numerical answer) – The attributes of three arithmetic operators in some programming language are given below. Operator Precedence Associativity Arity --- --- --- --- +…
  56. Question 56 (2 marks, Multiple choice) – Consider the following Syntax Directed Translation Scheme (SDTS), with non-terminals \S, A\ and terminals \a, b\. S aA print 1 S a print 2 A Sb print…
  57. Question 57 (2 marks, Numerical answer) – Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per…
  58. Question 58 (2 marks, Numerical answer) – Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head…
  59. Question 59 (2 marks, Numerical answer) – Consider a computer system with ten physical page frames. The system is provided with an access sequence (a 1, a 2, , a 20, a 1, a 2, , a 20), where…
  60. Question 60 (2 marks, Multiple choice) – Consider the following proposed solution for the critical section problem. There are n processes: P 0 P n-1. In the code, function `pmax` returns an…
  61. Question 61 (2 marks, Multiple choice) – Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects \O 1, , O…
  62. Question 62 (2 marks, Multiple choice) – Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A and B be denoted by K x- and K…
  63. Question 63 (2 marks, Numerical answer) – An IP datagram of size 1000 bytes arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is 100…
  64. Question 64 (2 marks, Numerical answer) – For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 megabyte and the maximum output…
  65. Question 65 (2 marks, Numerical answer) – A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the…