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

Engineering Mathematics and Algorithms together made up 33 of 85 marks, up 11 from GATE CSE 2013. 21 of 55 questions were NAT, more than in any earlier paper. Calculus was the heaviest single topic with 5 marks across 3 questions. Engineering Mathematics moved the most against GATE CSE 2013: up 10 marks.

1. Q1 · MCQ · 1 mark · Discrete MathematicsConsider the statement “Not all that glitters is gold” Predicate glitters(x) is true if x glitters and predicate gold(x) is true if x is gold. Which one of the following…
2. Q2 · NAT · 1 mark · Probability and StatisticsSuppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is …
3. Q3 · MCQ · 1 mark · Graph TraversalsLet G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components…
4. Q4 · NAT · 1 mark · Linear AlgebraConsider the following system of equations: 3x + 2y &= 1 4x + 7z &= 1 x + y + z &= 3 x - 2y + 7z &= 0 The number of solutions for this system is …
5. Q5 · NAT · 1 mark · Linear AlgebraThe value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a 4-by-4 symmetric positive definite matrix is …
6. Q6 · MCQ · 1 mark · CalculusLet the function f( ) = sin & cos & an sin( /6) & cos( /6) & an( /6) sin( /3) & cos( /3) & an( /3) where ∈ [( )/(6), ( )/(3) ] and f'( ) denote the derivative of f with…
7. Q7 · MCQ · 1 mark · Boolean Algebra and MinimizationConsider the following Boolean expression for F: F(P, Q, R, S) = PQ + PQR + PQ RS The minimal sum-of-products form of F is
8. Q8 · NAT · 1 mark · Number Representation and ArithmeticThe base (or radix) of the number system such that the following equation holds is … (312)/(20) = 13.1
9. Q9 · NAT · 1 mark · Instruction Set and Addressing ModesA machine has a 32-bit architecture, with 1-word long instructions. It has 64 registers, each of which is 32 bits long. It needs to support 45 instructions, which have a…
10. Q10 · MCQ · 1 mark · Programming in CConsider the following program in C language: #include main() { int i; int *pi = &i; scanf("%d",pi); printf("%d ", i+5); } Which one of the following statements is TRUE?
11. Q11 · MCQ · 1 mark · Graph TraversalsLet G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matr…
12. Q12 · NAT · 1 mark · RecursionConsider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes is…
13. Q13 · MCQ · 1 mark · Graph TraversalsConsider the directed graph given below. Which one of the following is TRUE?
14. Q14 · MCQ · 1 mark · Searching, Sorting and HashingLet P be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let t1 and t2 be the number of comparisons made by P for the inputs…
15. Q15 · MCQ · 1 mark · Regular Expressions and Finite AutomataWhich one of the following is TRUE?
16. Q16 · MCQ · 1 mark · Regular Expressions and Finite AutomataConsider the finite automaton in the following figure. What is the set of reachable states for the input string 0011?
17. Q17 · MCQ · 1 mark · Data Flow AnalysesWhich one of the following is FALSE?
18. Q18 · MCQ · 1 mark · Software EngineeringMatch the following: 1) Waterfall model a) Specifications can be developed incrementally 2) Evolutionary model b) Requirements compromises are inevitable 3) Component-ba…
19. Q19 · NAT · 1 mark · File SystemsSuppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85…
20. Q20 · MCQ · 1 mark · Processes, Threads and IPCWhich one of the following is FALSE?
21. Q21 · MCQ · 1 mark · Integrity Constraints and Normal FormsConsider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E, F} → {G}, {F} → {I, J}, {E, H} → {K, L}, {K} → {M}, {L} → {N}…
22. Q22 · MCQ · 1 mark · SQLGiven the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table R(a, b, c) where a and…
23. Q23 · MCQ · 1 mark · Distance Vector and Link-State RoutingConsider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links. [S1] The compu…
24. Q24 · MCQ · 1 mark · Principles of LayeringWhich of the following are used to generate a message digest by the network security protocols? (P) RSA (Q) SHA-1 (R) DES (S) MD5
25. Q25 · MCQ · 1 mark · DNS and HTTPIdentify the correct order in which the following actions take place in an interaction between a web browser and a web server. 1. The web browser requests a webpage usin…
26. Q26 · NAT · 2 marks · Data Link LayerConsider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is 2 × 108 m/s and the token t…
27. Q27 · NAT · 2 marks · TCP Flow and Congestion ControlLet the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used…
28. Q28 · NAT · 2 marks · Data Link LayerConsider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link u…
29. Q29 · MCQ · 2 marks · Transactions and Concurrency ControlConsider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively…
30. Q30 · MCQ · 2 marks · Integrity Constraints and Normal FormsGiven the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. S2: AB→ C, D→ E, E→ C is a minimal cover for the set…
31. Q31 · MCQ · 2 marks · DeadlockAn operating system uses the *Banker's algorithm* for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and…
32. Q32 · NAT · 2 marks · CPU and I/O SchedulingConsider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds. Using the *shortest remaining time first* sch…
33. Q33 · NAT · 2 marks · Memory Management and Virtual MemoryAssume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the *opti…
34. Q34 · MCQ · 2 marks · ParsingA canonical set of items is given below S → L. > R Q → R. On input symbol < the set has
35. Q35 · MCQ · 2 marks · Turing Machines and UndecidabilityLet L be a language and L be its complement. Which one of the following is NOT a viable possibility?
36. Q36 · MCQ · 2 marks · Regular Expressions and Finite AutomataWhich of the regular expressions given below represent the following DFA? I) 0*1(1+00*1)* II) 0*1*1+11*0*1 III) (0+1)*1
37. Q37 · NAT · 2 marks · CombinatoricsThere are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags have coins of weight 10 gm, others have coins of weight 11 gm. I pick 1, 2,…
38. Q38 · MCQ · 2 marks · Turing Machines and UndecidabilitySuppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents th…
39. Q39 · NAT · 2 marks · Searching, Sorting and HashingThe minimum number of comparisons required to find the minimum and the maximum of 100 numbers is …
40. Q40 · MCQ · 2 marks · Searching, Sorting and HashingConsider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28,…
41. Q41 · MCQ · 2 marks · Programming in CConsider the following C function in which size is the number of elements in the array E : int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0;…
42. Q42 · MCQ · 2 marks · Asymptotic AnalysisConsider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3
43. Q43 · NAT · 2 marks · Instruction PipeliningConsider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is execu…
44. Q44 · MCQ · 2 marks · Cache Memory and HierarchyAn access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses t…
45. Q45 · MCQ · 2 marks · Combinational and Sequential CircuitsConsider the 4-to-1 multiplexer with two select lines S1 and S0 given below. The minimal sum-of-products form of the Boolean expression for the output F of the multiplex…
46. Q46 · NAT · 2 marks · CalculusThe function f(x) = x sin x satisfies the following equation: f''(x) + f(x) + t cos x = 0. The value of t is …
47. Q47 · MCQ · 2 marks · CalculusA function f(x) is continuous in the interval [0,2]. It is known that f(0) = f(2) = -1 and f(1) = 1. Which one of the following statements must be true?
48. Q48 · NAT · 2 marks · Probability and StatisticsFour fair six-sided dice are rolled. The probability that the sum of the results being 22 is X/1296. The value of X is …
49. Q49 · NAT · 2 marks · CombinatoricsA pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of…
50. Q50 · NAT · 2 marks · Sets, Relations and FunctionsLet S denote the set of all functions f: {0,1}4 → {0,1}. Denote by N the number of functions from S to the set {0,1}. The value of log2 log2 N is …
51. Q51 · NAT · 2 marks · Graph TheoryConsider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j): 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a,b) and (c,d) if |a -…
52. Q52 · MCQ · 2 marks · Graph TheoryAn ordered n-tuple (d1, d2, ..., dn) with d1 ≥ d2 ≥ ≥ dn is called *graphic* if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn res…
53. Q53 · MCQ · 2 marks · Propositional and First-Order LogicWhich one of the following propositional logic formulas is TRUE when exactly two of p, q, and r are TRUE?
54. Q54 · MCQ · 2 marks · SQLGiven the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want to dis…
55. Q55 · NAT · 2 marks · Cache Memory and HierarchyConsider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less…

How many questions were in GATE CSE 2014 Set 1?

GATE CSE 2014 Set 1 had 55 questions for 85 marks: 34 MCQ, 0 MSQ and 21 NAT.

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

Engineering Mathematics carried the most marks (23 of 85). The top three were Engineering Mathematics (23), Algorithms (10), Computer Networks (9).

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

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

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