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

Engineering Mathematics and Programming and Data Structures together made up 30 of 85 marks, up 8 from GATE CSE 2013. 22 of 55 questions were NAT, more than in any earlier paper. Cache Memory and Hierarchy was the heaviest single topic with 7 marks across 4 questions. Engineering Mathematics moved the most against GATE CSE 2013: up 6 marks.

1. Q1 · NAT · 1 mark · Probability and StatisticsThe security system at an IT office is composed of 10 computers of which exactly four are working. To check whether the system is functional, the officials inspect four…
2. Q2 · NAT · 1 mark · Probability and StatisticsEach of the nine words in the sentence "The quick brown fox jumps over the lazy dog" is written on a separate piece of paper. These nine pieces of paper are kept in a bo…
3. Q3 · NAT · 1 mark · Discrete MathematicsThe maximum number of edges in a bipartite graph on 12 vertices is …
4. Q4 · NAT · 1 mark · Linear AlgebraIf the matrix A is such that A = 2 -4 7 1 & 9 & 5 then the determinant of A is equal to …
5. Q5 · MCQ · 1 mark · CalculusA non-zero polynomial f(x) of degree 3 has roots at x = 1, x = 2 and x = 3. Which one of the following must be TRUE?
6. Q6 · MCQ · 1 mark · Boolean Algebra and MinimizationThe dual of a Boolean function F(x1, x2, , xn, +, ·, '), written as FD, is the same expression as that of F with + and · swapped. F is said to be self-dual if F = FD. Th…
7. Q7 · MCQ · 1 mark · Combinational and Sequential CircuitsLet k = 2n. A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2n bit decoder. This circuit is equivalent to a
8. Q8 · NAT · 1 mark · Number Representation and ArithmeticConsider the equation (123)5 = (x8)y with x and y as unknown. The number of possible solutions is …
9. Q9 · NAT · 1 mark · Cache Memory and HierarchyA 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address s…
10. Q10 · NAT · 1 mark · Programming in CConsider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); } The value returned by func(435) is …
11. Q11 · MCQ · 1 mark · Programming in CSuppose n and p are unsigned int variables in a C program. We wish to set p to nC3. If n is large, which one of the following statements is most likely to set p correctl…
12. Q12 · MCQ · 1 mark · Binary HeapsA priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inser…
13. Q13 · MCQ · 1 mark · Asymptotic AnalysisWhich one of the following correctly determines the solution of the recurrence relation with T(1) = 1? T(n) = 2T ((n)/(2) ) + log n
14. Q14 · MCQ · 1 mark · Graph TraversalsConsider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for…
15. Q15 · MCQ · 1 mark · Regular Expressions and Finite AutomataIf L1 = {an n ≥ 0} and L2 = {bn n ≥ 0}, consider (I) L1 · L2 is a regular language (II) L1 · L2 = {an bn n ≥ 0} Which one of the following is CORRECT?
16. Q16 · MCQ · 1 mark · Turing Machines and UndecidabilityLet A ≤m B denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?
17. Q17 · MCQ · 1 mark · ParsingConsider the grammar defined by the following production rules, with two operators * and + S → T * P T → U T * U P → Q + P Q Q → Id U → Id Which one of the following is…
18. Q18 · MCQ · 1 mark · Runtime EnvironmentsWhich one of the following is NOT performed during compilation?
19. Q19 · MCQ · 1 mark · Software Requirements and PrototypingWhich one of the following is TRUE?
20. Q20 · NAT · 1 mark · File SystemsA FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 × 106 bytes disk on which t…
21. Q21 · NAT · 1 mark · Integrity Constraints and Normal FormsThe maximum number of superkeys for the relation schema R (E, F, G, H) with E as the key is …
22. Q22 · NAT · 1 mark · Integrity Constraints and Normal FormsGiven an instance of the STUDENTS relation as shown below: For ( StudentName, StudentAge) to be a key for this instance, the value X should NOT be equal to …
23. Q23 · MCQ · 1 mark · Distance Vector and Link-State RoutingWhich one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
24. Q24 · MCQ · 1 mark · TCP Flow and Congestion ControlWhich one of the following socket API functions converts an unconnected active TCP socket into a passive socket?
25. Q25 · NAT · 1 mark · IPv4 FragmentationIn the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links within each I…
26. Q26 · MCQ · 2 marks · Switching and Performance MetricsConsider the store and forward packet switched network given below. Assume that the bandwidth of each link is 106 bytes / sec. A user on host A sends a file of size 103…
27. Q27 · MCQ · 2 marks · Principles of LayeringAn IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3. Q—R1—R2—R3—H H acts as an HTTP server, and Q connects to H via HTTP and downloads…
28. Q28 · MCQ · 2 marks · DNS and HTTPA graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded…
29. Q29 · MCQ · 2 marks · Transactions and Concurrency ControlConsider the following schedule S of transactions T1, T2, T3, T4: Which one of the following statements is CORRECT?
30. Q30 · MCQ · 2 marks · File Organization and IndexingConsider a join (relation algebra) between relations r (R) and s (S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of whic…
31. Q31 · MCQ · 2 marks · Concurrency and SynchronizationConsider the procedure below for the *Producer-Consumer* problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semW…
32. Q32 · NAT · 2 marks · CPU and I/O SchedulingThree processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires tc CPU millisecond…
33. Q33 · MCQ · 2 marks · Memory Management and Virtual MemoryA computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, ..., 100 in that order, and repe…
34. Q34 · MCQ · 2 marks · Intermediate Code GenerationFor a C program accessing X[i][j][k] , the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a charac…
35. Q35 · MCQ · 2 marks · Turing Machines and UndecidabilityLet M be the encoding of a Turing machine as a string over = {0,1}. Let L = { M M is a Turing machine that accepts a string of length 2014}. Then, L is
36. Q36 · MCQ · 2 marks · Regular Expressions and Finite AutomataLet L1 = {w ∈ {0,1}* w has at least as many occurrences of (110)'s as (011)'s}. Let L2 = {w ∈ {0,1}* w has at least as many occurrences of (000)'s as (111)'s}. Which one…
37. Q37 · NAT · 2 marks · Dynamic ProgrammingConsider two strings A = "qpqrr" and B = "pqrqrp". Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the nu…
38. Q38 · NAT · 2 marks · Searching, Sorting and HashingSuppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences…
39. Q39 · NAT · 2 marks · TreesConsider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximu…
40. Q40 · NAT · 2 marks · RecursionConsider the following function double f(double x) { if ( abs(x*x - 3) Give a value q (to 2 decimals) such that f (q) will return q: …
41. Q41 · MCQ · 2 marks · Linear Structures, Trees and HeapsSuppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which on…
42. Q42 · MCQ · 2 marks · RecursionConsider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the…
43. Q43 · MCQ · 2 marks · Cache Memory and HierarchyIn designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?
44. Q44 · MCQ · 2 marks · Cache Memory and HierarchyIf the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
45. Q45 · MCQ · 2 marks · Number Representation and ArithmeticThe value of a float type variable is represented using the single-precision 32-bit floating point format of IEEE-754 standard that uses 1 bit for sign, 8 bits for biase…
46. Q46 · MCQ · 2 marks · CalculusIn the Newton-Raphson method, an initial guess of x0 = 2 is made and the sequence x0, x1, x2 is obtained for the function 0.75x3 - 2x2 - 2x + 4 = 0 Consider the statemen…
47. Q47 · NAT · 2 marks · Linear AlgebraThe product of the non-zero eigenvalues of the matrix 1 & 0 & 0 & 0 & 1 0 & 1 & 1 & 1 & 0 0 & 1 & 1 & 1 & 0 0 & 1 & 1 & 1 & 0 1 & 0 & 0 & 0 & 1 is …
48. Q48 · NAT · 2 marks · Probability and StatisticsThe probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is …
49. Q49 · NAT · 2 marks · Discrete MathematicsThe number of distinct positive integral factors of 2014 is …
50. Q50 · MCQ · 2 marks · Discrete MathematicsConsider the following relation on subsets of the set S of integers between 1 and 2014. For two distinct subsets U and V of S we say U < V if the minimum element in the…
51. Q51 · NAT · 2 marks · Graph TheoryA cycle on n vertices is isomorphic to its complement. The value of n is 1cm .
52. Q52 · NAT · 2 marks · Graph Traversals, MSTs and Shortest PathsThe number of distinct minimum spanning trees for the weighted graph below is 1cm
53. Q53 · MCQ · 2 marks · Propositional and First-Order LogicWhich one of the following Boolean expressions is NOT a tautology?
54. Q54 · MCQ · 2 marks · Relational Model and SQLSQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives…
55. Q55 · NAT · 2 marks · Cache Memory and HierarchyConsider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for…

How many questions were in GATE CSE 2014 Set 2?

GATE CSE 2014 Set 2 had 55 questions for 85 marks: 33 MCQ, 0 MSQ and 22 NAT.

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

Engineering Mathematics carried the most marks (19 of 85). The top three were Engineering Mathematics (19), Programming and Data Structures (11), Computer Networks (9).

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

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

Is the GATE CSE 2014 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 2014 Set 1 question paper
• GATE CSE 2014 Set 3 question paper
• GATE CSE 2013 question paper
• GATE CSE 2015 Set 2 question paper
• All GATE CSE papers →
• GATE CSE Engineering Mathematics PYQs
• GATE CSE Programming and Data Structures PYQs
• GATE CSE Computer Networks PYQs