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

Engineering Mathematics and Programming and Data Structures together made up 31 of 85 marks, up 9 from GATE CSE 2013. 18 of 55 questions were NAT, more than in any earlier paper. IPv4, CIDR and NAT was the heaviest single topic with 7 marks across 4 questions. Engineering Mathematics moved the most against GATE CSE 2013: up 9 marks.

1. Q1 · MCQ · 1 mark · Propositional and First-Order LogicConsider the following statements: 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 on…
2. Q2 · MCQ · 1 mark · Sets, Relations, Lattices and GroupsLet X and Y be finite sets and f: X → Y be a function. Which one of the following statements is TRUE?
3. Q3 · NAT · 1 mark · Sets, Relations, Lattices and GroupsLet G be a group with 15 elements. Let L be a subgroup of G. It is known that L ≠ G and that the size of L is at least 4. The size of L is …
4. Q4 · MCQ · 1 mark · Linear AlgebraWhich one of the following statements is TRUE about every n × n matrix with only real eigenvalues?
5. Q5 · NAT · 1 mark · Linear AlgebraIf V1 and V2 are 4-dimensional subspaces of a 6-dimensional vector space V, then the smallest possible dimension of V1 ∩ V2 is …
6. Q6 · NAT · 1 mark · CalculusIf 02 |x sin x| dx = k , then the value of k is equal to …
7. Q7 · MCQ · 1 mark · Boolean Algebra and MinimizationConsider the following minterm expression for F: F (P, Q, R, S) = Σ 0, 2, 5, 7, 8, 10, 13, 15 The minterms 2, 7, 8 and 13 are 'do not care' terms. The minimal sum-of-pro…
8. Q8 · MCQ · 1 mark · Combinational and Sequential CircuitsConsider the following combinational function block involving four Boolean variables x, y, a, b where x, a, b are inputs and y is the output. f (x, y, a, b) { if (x is 1…
9. Q9 · MCQ · 1 mark · Instruction PipeliningConsider the following processors (ns stands for nanoseconds). Assume that the pipeline registers have zero latency. P1: Four-stage pipeline with stage latencies 1 ns, 2…
10. Q10 · MCQ · 1 mark · Programming in CLet A be a square matrix of size n × n. Consider the following pseudocode. What is the expected output? C = 100; for i = 1 to n do for j = 1 to n do { Temp = A[i][j] + C…
11. Q11 · NAT · 1 mark · Programming in CThe minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4 X3 + 6 X + 5 for a given value of X, using only one temporary variable is …
12. Q12 · MCQ · 1 mark · TreesConsider the following rooted tree with the vertex labeled P as the root: The order in which the nodes are visited during an in-order traversal of the tree is
13. Q13 · NAT · 1 mark · Graph TraversalsSuppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checki…
14. Q14 · MCQ · 1 mark · Searching, Sorting and HashingYou have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the…
15. Q15 · NAT · 1 mark · Regular Expressions and Finite AutomataThe length of the shortest string NOT in the language (over = {a, b}) of the following regular expression is … a*b*(ba)*a*
16. Q16 · MCQ · 1 mark · Turing Machines and UndecidabilityLet be a finite non-empty alphabet and let 2 * be the power set of *. Which one of the following is TRUE?
17. Q17 · MCQ · 1 mark · Intermediate Code GenerationOne of the purposes of using intermediate code in compilers is to
18. Q18 · MCQ · 1 mark · Runtime EnvironmentsWhich of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) Automatic garbage coll…
19. Q19 · MCQ · 1 mark · Modular Software DesignIn the context of modular software design, which one of the following combinations is desirable?
20. Q20 · NAT · 1 mark · Memory Management and Virtual MemoryA system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are…
21. Q21 · MCQ · 1 mark · Relational AlgebraWhat is the optimized version of the relation algebra expression A1( A2( F1( F2(r)))), where A1, A2 are sets of attributes in r with A1 ⊂ A2 and F1, F2 are Boolean expre…
22. Q22 · MCQ · 1 mark · Integrity Constraints and Normal FormsA prime attribute of a relation scheme R is an attribute that appears
23. Q23 · MCQ · 1 mark · Principles of LayeringIn the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
24. Q24 · MCQ · 1 mark · Data Link LayerA bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
25. Q25 · MCQ · 1 mark · IPv4, CIDR and NATHost A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reache…
26. Q26 · NAT · 2 marks · IPv4, CIDR and NATAn IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries: Refer…
27. Q27 · NAT · 2 marks · IPv4, CIDR and NATEvery host in an IPv4 network has a 1-second resolution real-time clock with battery backup. Each host needs to generate up to 1000 unique identifiers per second. Assume…
28. Q28 · MCQ · 2 marks · IPv4, CIDR and NATAn IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the re…
29. Q29 · MCQ · 2 marks · Transactions and Concurrency ControlConsider the transactions T1 , T2 , and T3 and the schedules S1 and S2 given below. T1: r1(X); r1(Z); w1(X); w1(Z) T2: r2(Y); r2(Z); w2(Z) T3: r3(Y); r3(X); w3(Y) S1: r1…
30. Q30 · MCQ · 2 marks · Relational Model and SQLConsider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee . Assume that every employee…
31. Q31 · NAT · 2 marks · DeadlockA system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks ne…
32. Q32 · NAT · 2 marks · CPU and I/O SchedulingAn operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their a…
33. Q33 · NAT · 2 marks · Memory Management and Virtual MemoryConsider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80…
34. Q34 · MCQ · 2 marks · Local OptimisationConsider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the ab…
35. Q35 · MCQ · 2 marks · Turing Machines and UndecidabilityWhich one of the following problems is undecidable?
36. Q36 · MCQ · 2 marks · Regular and Context-Free LanguagesConsider the following languages over the alphabet = {0, 1, c}: L1 &= {0n 1n n ≥ 0} L2 &= {w c wr w ∈ {0, 1}*} L3 &= {w wr w ∈ {0, 1}*} Here, wr is the reverse of the st…
37. Q37 · NAT · 2 marks · Algorithm Design TechniquesSuppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance or you take a *shortcut*. A shortcut is simply a pre-sp…
38. Q38 · MCQ · 2 marks · Searching, Sorting and HashingConsider the decision problem 2CNFSAT defined as follows: is a satisfiable propositional formula in CNF with at most two literals per clause For example, = (x1 x2) (x1 x…
39. Q39 · NAT · 2 marks · Binary Search TreesSuppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the numbers in T that lie between L and H. Sup…
40. Q40 · MCQ · 2 marks · Searching, Sorting and HashingConsider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfille…
41. Q41 · MCQ · 2 marks · TreesConsider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSiblin…
42. Q42 · MCQ · 2 marks · Programming in CConsider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i…
43. Q43 · NAT · 2 marks · Instruction PipeliningAn instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM),…
44. Q44 · NAT · 2 marks · Cache Memory and HierarchyThe memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a write opera…
45. Q45 · MCQ · 2 marks · Combinational and Sequential CircuitsThe above synchronous sequential circuit built using JK flip-flops is initialized with Q2Q1Q0 = 000. The state sequence for this circuit for the next 3 clock cycles is
46. Q46 · MCQ · 2 marks · CalculusWith respect to the numerical evaluation of the definite integral, K = ab x2 dx, where a and b are given, which of the following statements is/are TRUE? I) The value of…
47. Q47 · MCQ · 2 marks · CalculusThe value of the integral given below is 0 x2 cos x dx
48. Q48 · NAT · 2 marks · Probability and StatisticsLet S be a sample space and two mutually exclusive events A and B be such that A ∪ B = S. If P(·) denotes the probability of the event, the maximum value of P(A)P(B) is …
49. Q49 · MCQ · 2 marks · Sets, Relations and FunctionsConsider the set of all functions f {0, 1, , 2014} → {0, 1, , 2014} such that f(f(i)) = i, for all 0 ≤ i ≤ 2014. Consider the following statements: P. For each such func…
50. Q50 · NAT · 2 marks · Sets, Relations, Lattices and GroupsThere are two elements x, y in a group (G, *) such that every element in the group can be written as a product of some number of x's and y's in some order. It is known t…
51. Q51 · MCQ · 2 marks · Graph TheoryIf G is a forest with n vertices and k connected components, how many edges does G have?
52. Q52 · MCQ · 2 marks · Graph TheoryLet denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices with ≥ 3, which one of the following is TRUE?
53. Q53 · MCQ · 2 marks · Propositional and First-Order LogicThe CORRECT formula for the sentence, “not all rainy days are cold” is
54. Q54 · MCQ · 2 marks · SQLConsider the following relational schema: employee(empId, empName, empDept) customer(custId, custName, salesRepId, rating) salesRepId is a foreign key referring to empId…
55. Q55 · MCQ · 2 marks · Boolean Algebra and MinimizationLet ⊕ denote the Exclusive OR (XOR) operation. Let ‘1’ and ‘0’ denote the binary constants. Consider the following Boolean expression for F over two variables P and Q: F…

How many questions were in GATE CSE 2014 Set 3?

GATE CSE 2014 Set 3 had 55 questions for 85 marks: 37 MCQ, 0 MSQ and 18 NAT.

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

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

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

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

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