GATE CSE 2017 Set 2 Question Paper with Solutions & Answer Key

Engineering Mathematics and General Aptitude together made up 30 of 100 marks, up 16 from GATE CSE 2016 Set 2. 20 of 65 questions were NAT, the most since 2016. Programming in C was the heaviest single topic with 10 marks across 6 questions. General Aptitude moved the most against GATE CSE 2016 Set 2: up 15 marks.

1. Q1 · MCQ · 1 mark · Number Representation and ArithmeticThe representation of the value of a 16-bit unsigned integer X in hexadecimal number system is BCA9. The representation of the value of X in octal number system is
2. Q2 · MCQ · 1 mark · Programming in CMatch the following:
3. Q3 · MCQ · 1 mark · Asymptotic AnalysisMatch the algorithms with their time complexities:
4. Q4 · MCQ · 1 mark · Regular and Context-Free LanguagesLet L1, L2 be any two context-free languages and R be any regular language. Then which of the following is/are CORRECT? I. L1 ∪ L2 is context-free. II. L1 is context-fre…
5. Q5 · MCQ · 1 mark · Lexical Analysis, Parsing and SDTMatch the following according to input (from the left column) to the compiler phase (in the right column) that processes it:
6. Q6 · MCQ · 1 mark · Lexical Analysis, Parsing and SDTWhich of the following statements about parser is/are CORRECT? I. Canonical LR is more powerful than SLR. II. SLR is more powerful than LALR. III. SLR is more powerful t…
7. Q7 · MCQ · 1 mark · Processes, Threads and IPCWhich of the following is/are shared by all the threads in a process? I. Program counter II. Stack III. Address space IV. Registers
8. Q8 · MCQ · 1 mark · File SystemsIn a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? I. Contiguous II. Linked III. Indexed
9. Q9 · MCQ · 1 mark · Distance Vector and Link-State RoutingConsider the following statements about the routing protocols, Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an IPv4 network. I: RIP uses dis…
10. Q10 · MCQ · 1 mark · CalculusIf f(x) = R sin (( x)/(2) ) + S, f' ((1)/(2) ) = √(2) and 01 f(x)dx = (2R)/( ), then the constants R and S are, respectively
11. Q11 · MCQ · 1 mark · Discrete MathematicsLet p, q, r denote the statements “It is raining”, “It is cold”, and “It is pleasant”, respectively. Then the statement “It is not raining and it is pleasant, and it is…
12. Q12 · MCQ · 1 mark · Number Representation and ArithmeticGiven the following binary number in 32-bit (single precision) IEEE-754 format: 00111110011011010000000000000000 The decimal value closest to this floating-point number…
13. Q13 · MCQ · 1 mark · Linear Structures, Trees and HeapsA circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly…
14. Q14 · MCQ · 1 mark · Programming in CConsider the following function implemented in C: void printxy(int x, int y) { int *ptr; x = 0; ptr = &x; y = *ptr; *ptr = 1; printf("%d,%d",x,y); } The output of invoki…
15. Q15 · MCQ · 1 mark · Graph TraversalsThe Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the…
16. Q16 · MCQ · 1 mark · Context-Free Grammars and PDAsIdentify the language generated by the following grammar, where S is the start variable. S &→ XY X &→ aX a Y &→ aYb
17. Q17 · MCQ · 1 mark · ER ModelAn ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which one of the followi…
18. Q18 · MCQ · 1 mark · TCP Flow and Congestion ControlConsider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which connect function has already been called. Whi…
19. Q19 · NAT · 1 mark · Integrity Constraints and Normal FormsConsider the following tables T1 and T2. In table T1, P is the primary key and Q is the foreign key referencing R in table T2 with on-delete cascade and on-update cascad…
20. Q20 · NAT · 1 mark · IPv4, CIDR and NATThe maximum number of IPv4 router addresses that can be listed in the record route (RR) option field of an IPv4 header is …
21. Q21 · NAT · 1 mark · Discrete MathematicsConsider the set X = {a,b,c,d,e} under the partial ordering R = {(a,a),(a,b),(a,c),(a,d),(a,e),(b,b),(b,c),(b,e),(c,c),(c,e),(d,d),(d,e),(e,e)}. The Hasse diagram of the…
22. Q22 · NAT · 1 mark · Linear AlgebraLet P = 1 & 1 & -1 2 & -3 & 4 3 & -2 & 3 and Q = -1 & -2 & -1 6 & 12 & 6 5 & 10 & 5 be two matrices. Then the rank of P + Q is …
23. Q23 · NAT · 1 mark · Discrete MathematicsG is an undirected graph with n vertices and 25 edges such that each vertex of G has degree at least 3. Then the maximum possible value of n is …
24. Q24 · NAT · 1 mark · Number Representation and ArithmeticConsider a quadratic equation x2 - 13x + 36 = 0 with coefficients in a base b. The solutions of this equation in the same base b are x = 5 and x = 6. Then b = …
25. Q25 · NAT · 1 mark · Regular Expressions and Finite AutomataThe minimum possible number of states of a deterministic finite automaton that accepts the regular language L = {w1 a w2 w1, w2 ∈ {a, b}*, |w1| = 2, |w2| ≥ 3} is …
26. Q26 · MCQ · 2 marks · Probability and StatisticsP and Q are considering to apply for a job. The probability that P applies for the job is (1)/(4), the probability that P applies for the job given that Q applies for th…
27. Q27 · MCQ · 2 marks · Boolean Algebra and MinimizationIf w, x, y, z are Boolean variables, then which one of the following is INCORRECT?
28. Q28 · MCQ · 2 marks · Boolean Algebra and MinimizationGiven f(w, x, y, z) = Σm(0,1,2,3,7,8,10) + Σd(5,6,11,15), where d represents the *don't-care* condition in Karnaugh maps. Which of the following is a minimum product-of-…
29. Q29 · MCQ · 2 marks · Cache Memory and HierarchyIn a two-level cache system, the access times of L1 and L2 caches are 1 and 8 clock cycles, respectively. The miss penalty from the L2 cache to main memory is 18 clock c…
30. Q30 · MCQ · 2 marks · Asymptotic AnalysisConsider the recurrence function T(n) = 2T(√(n)) + 1, & n > 2 2, & 0 < n ≤ 2 Then T(n) in terms of notation is
31. Q31 · MCQ · 2 marks · Probability and StatisticsFor any discrete random variable X, with probability mass function P(X = j) = pj, pj ≥ 0, j ∈ {0, , N}, and Σj=0N pj = 1, define the polynomial function gX(z) = Σj=0N pj…
32. Q32 · MCQ · 2 marks · ParsingConsider the following expression grammar G: E &→ E - T T T &→ T + F F F &→ (E) id Which of the following grammars is not left recursive, but is equivalent to G?
33. Q33 · MCQ · 2 marks · DeadlockA system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Which of the following best describes c…
34. Q34 · MCQ · 2 marks · Data Link LayerConsider a binary code that consists of only four valid codewords as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code be p and the ma…
35. Q35 · MCQ · 2 marks · Switching and Performance MetricsConsider two hosts X and Y, connected by a single direct link of rate 106 bits/sec. The distance between the two hosts is 10,000 km and the propagation speed along the l…
36. Q36 · MCQ · 2 marks · Binary Search TreesThe pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:
37. Q37 · MCQ · 2 marks · Programming in CConsider the C program fragment below which is meant to divide x by y using repeated subtractions. The variables x , y , q and r are all unsigned int . while (r >= y) {…
38. Q38 · MCQ · 2 marks · Asymptotic AnalysisConsider the following C function. int fun(int n) { int i, j; for(i = 1; i Time complexity of fun in terms of notation is
39. Q39 · MCQ · 2 marks · Regular Expressions and Finite AutomataLet denote the transition function and denote the extended transition function of the -NFA whose transition table is given below: Then (q2, aba) is
40. Q40 · MCQ · 2 marks · Regular and Context-Free LanguagesConsider the following languages. L1 = {ap p is a prime number} L2 = {an bm c2m n ≥ 0, m ≥ 0} L3 = {an bn c2n n ≥ 0} L4 = {an bn n ≥ 1} Which of the following are CORREC…
41. Q41 · MCQ · 2 marks · Turing Machines and UndecidabilityLet L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turi…
42. Q42 · MCQ · 2 marks · Combinational and Sequential CircuitsThe next state table of a 2-bit saturating up-counter is given below. The counter is built as a synchronous sequential circuit using T flip-flops. The expressions for T1…
43. Q43 · NAT · 2 marks · Programming in CConsider the following snippet of a C program. Assume that swap (&x, &y) exchanges the contents of x and y . int main() { int array[] = {3, 5, 1, 4, 6, 2}; int done = 0;…
44. Q44 · NAT · 2 marks · Transactions and Concurrency ControlTwo transactions T1 and T2 are given as T1: r1(X)w1(X)r1(Y)w1(Y) T2: r2(Y)w2(Y)r2(Z)w2(Z) where ri(V) denotes a read operation by transaction Ti on a variable V and wi(V…
45. Q45 · NAT · 2 marks · Cache Memory and HierarchyThe read access times and the hit ratios for different caches in a memory hierarchy are as given below. The read access time of main memory is 90 nanoseconds. Assume tha…
46. Q46 · NAT · 2 marks · Relational Model and SQLConsider the following database table named topscorer . Consider the following SQL query: SELECT ta.player FROM topscorer AS ta WHERE ta.goals >ALL (SELECT tb.goals FROM…
47. Q47 · NAT · 2 marks · CombinatoricsIf the ordinary generating function of a sequence {an}n=0∞ is (1+z)/((1-z)3), then a3 - a0 is equal to …
48. Q48 · NAT · 2 marks · Probability and StatisticsIf a random variable X has a Poisson distribution with mean 5, then the expectation E[(X + 2)2] equals …
49. Q49 · NAT · 2 marks · File Organization and IndexingIn a B+ tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then the maximum order of the B+ tree is …
50. Q50 · NAT · 2 marks · Algorithm Design TechniquesA message is made up entirely of characters from the set X = {P, Q, R, S, T}. The table of probabilities for each of the characters is shown below: If a message of 100 c…
51. Q51 · NAT · 2 marks · CPU and I/O SchedulingConsider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the pr…
52. Q52 · NAT · 2 marks · Linear AlgebraIf the characteristic polynomial of a 3 × 3 matrix M over R (the set of real numbers) is 3 - 4 2 + a + 30, a ∈ R, and one eigenvalue of M is 2, then the largest among th…
53. Q53 · NAT · 2 marks · Cache Memory and HierarchyConsider a machine with a byte addressable main memory of 232 bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is use…
54. Q54 · NAT · 2 marks · Programming in CConsider the following C Program. #include int main() { int m = 10; int n, n1; n = ++m; n1 = m++; n--; --n1; n -= n1; printf("%d", n); return 0; } The output of the prog…
55. Q55 · NAT · 2 marks · Programming in CConsider the following C Program. #include #include int main() { char* c = "GATECSIT2017"; char* p = c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; } The output…
56. Q56 · MCQ · 1 mark · Verbal AptitudeChoose the option with words that are not synonyms.
57. Q57 · MCQ · 1 mark · Verbal AptitudeSaturn is … to be seen on a clear night with the naked eye.
58. Q58 · MCQ · 1 mark · Analytical AptitudeThere are five buildings called V, W, X, Y and Z in a row (not necessarily in that order). V is to the West of W. Z is to the East of X and the West of V. W is to the We…
59. Q59 · MCQ · 1 mark · Quantitative AptitudeA test has twenty questions worth 100 marks in total. There are two types of questions. Multiple choice questions are worth 3 marks each and essay questions are worth 11…
60. Q60 · MCQ · 1 mark · Quantitative AptitudeThere are 3 red socks, 4 green socks and 3 blue socks. You choose 2 socks. The probability that they are of the same colour is
61. Q61 · MCQ · 2 marks · Verbal Aptitude“We lived in a culture that denied any merit to literary works, considering them important only when they were handmaidens to something seemingly more urgent – namely id…
62. Q62 · MCQ · 2 marks · Analytical AptitudeThere are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labelled. I…
63. Q63 · MCQ · 2 marks · Quantitative AptitudeX is a 30 digit number starting with the digit 4 followed by the digit 7. Then the number X3 will have
64. Q64 · MCQ · 2 marks · CalculusThe number of roots of ex + 0.5x2 - 2 = 0 in the range [-5, 5] is
65. Q65 · MCQ · 2 marks · Data InterpretationAn air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical region. Co…

How many questions were in GATE CSE 2017 Set 2?

GATE CSE 2017 Set 2 had 65 questions for 100 marks: 45 MCQ, 0 MSQ and 20 NAT.

Which subject carried the most marks in GATE CSE 2017 Set 2?

Engineering Mathematics carried the most marks (15 of 100). The top three were Engineering Mathematics (15), General Aptitude (15), Programming and Data Structures (13).

Where can I find the GATE CSE 2017 Set 2 answer key?

The answer key table on this page lists the answer to every question of GATE CSE 2017 Set 2. Open any question for its full verified solution.

Is the GATE CSE 2017 Set 2 paper useful for GATE 2027 preparation?

Yes. Solving past GATE CSE papers shows how marks are spread across subjects and which topics repeat. Compare it with other GATE CSE question papers and the topic-wise GATE CSE PYQs.

• GATE CSE 2017 Set 1 question paper
• GATE CSE 2016 Set 2 question paper
• GATE CSE 2018 question paper
• All GATE CSE papers →
• GATE CSE Engineering Mathematics PYQs
• GATE CSE General Aptitude PYQs
• GATE CSE Programming and Data Structures PYQs