GATE CSE 2019 Question Paper with Solutions & Answer Key

Engineering Mathematics and Programming and Data Structures together made up 13 of 37 marks, up 1 from GATE CSE 2018. 9 of 31 questions were NAT, the most since 2018. Regular and Context-Free Languages was the heaviest single topic with 4 marks across 3 questions. Digital Logic moved the most against GATE CSE 2018: up 3 marks.

1. Q1 · MCQ · 1 mark · Cache Memory and HierarchyA certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit add…
2. Q2 · MCQ · 1 mark · Cache Memory and HierarchyThe chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by A15 to A0. What is…
3. Q3 · MCQ · 1 mark · Lexical Analysis, Parsing and SDTWhich one of the following kinds of derivation is used by LR parsers?
4. Q4 · MCQ · 1 mark · Number Representation and ArithmeticIn 16-bit 2's complement representation, the decimal number -28 is:
5. Q5 · MCQ · 1 mark · CombinatoricsLet U = {1,2, , n}. Let A = {(x, X)|x ∈ X, X ⊆ U}. Consider the following two statements on |A|. I. |A| = n2n-1 II. |A| = Σk=1n k nk Which of the above statements is/are…
6. Q6 · MCQ · 1 mark · Boolean Algebra and MinimizationWhich one of the following is NOT a valid identity?
7. Q7 · MCQ · 1 mark · Regular and Context-Free LanguagesIf L is a regular language over = {a, b}, which one of the following languages is NOT regular ?
8. Q8 · MCQ · 1 mark · Number Representation and ArithmeticConsider Z = X - Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a m…
9. Q9 · MCQ · 1 mark · Linear AlgebraLet X be a square matrix. Consider the following two statements on X. I. X is invertible. II. Determinant of X is non-zero. Which one of the following is TRUE?
10. Q10 · MCQ · 1 mark · Discrete MathematicsLet G be an arbitrary group. Consider the following relations on G: R1: ∀ a, b ∈ G, a R1 b if and only if ∃ g ∈ G such that a = g-1bg R2: ∀ a, b ∈ G, a R2 b if and only…
11. Q11 · MCQ · 1 mark · Transactions and Concurrency ControlConsider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also…
12. Q12 · MCQ · 1 mark · Discrete MathematicsLet G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
13. Q13 · MCQ · 1 mark · CalculusCompute limx → 3 (x4-81)/(2x2-5x-3)
14. Q14 · MCQ · 1 mark · File Organization and IndexingWhich one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
15. Q15 · MCQ · 1 mark · Regular and Context-Free LanguagesFor = {a, b}, let us consider the regular language L = {x x = a2+3k or x = b10+12k, k ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed b…
16. Q16 · MCQ · 1 mark · DNS and HTTPWhich of the following protocol pairs can be used to send and retrieve e-mails (in that order)?
17. Q17 · NAT · 1 mark · Processes, Threads and IPCThe following C program is executed on a Unix/Linux system: #include int main() { int i; for (i=0; i The total number of child processes created is …
18. Q18 · NAT · 1 mark · Programming in CConsider the following C program: #include int jumble(int x, int y){ x=2*x+y; return x; } int main(){ int x=2, y=5; y=jumble(y,x); x=jumble(y,x); printf("%d ", x); retur…
19. Q19 · NAT · 1 mark · Lexical Analysis, Parsing and SDTConsider the grammar given below: S → Aa A → BD B → b D → d Let a, b, d, and be indexed as follows: Compute the FOLLOW set of the non-terminal B and write the index valu…
20. Q20 · NAT · 1 mark · Searching, Sorting and HashingAn array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element get…
21. Q21 · NAT · 1 mark · CombinatoricsThe value of 351 mod 5 is …
22. Q22 · NAT · 1 mark · Probability and StatisticsTwo numbers are chosen independently and uniformly at random from the set {1, 2, , 13}. The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) bin…
23. Q23 · NAT · 1 mark · Processes, Threads and IPCConsider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100. Refer to the table below. The proces…
24. Q24 · NAT · 1 mark · Programming in CConsider the following C program: #include int main(){ int arr[]={1,2,3,4,5,6,7,8,9,0,1,2,5}, *ip=arr+4; printf("%d ", ip[1]); return 0; } The number that will be displa…
25. Q25 · NAT · 1 mark · Divide and ConquerConsider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum S(i,j) = Σk=ij A[k] . Determine the maximum of S(i,j),…
26. Q26 · MCQ · 2 marks · RecursionConsider the following C function. void convert(int n){ if(n Which one of the following will happen when the function convert is called with any positive integer n as ar…
27. Q27 · MCQ · 2 marks · Programming in CConsider the following C program: #include int r(){ static int num=7; return num--; } int main(){ for (r();r();r()) printf("%d",r()); return 0; } Which one of the follow…
28. Q28 · MCQ · 2 marks · IPv4, CIDR and NATConsider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to 255.255.255.252 for all the three ma…
29. Q29 · MCQ · 2 marks · Data Link LayerSuppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be…
30. Q30 · MCQ · 2 marks · Combinational and Sequential CircuitsConsider three 4-variable functions f1, f2, and f3, which are expressed in sum-of-minterms as f1 = Σ (0, 2, 5, 8, 14), f2 = Σ (2, 3, 6, 8, 14, 15), f3 = Σ (2, 7, 11, 14)…
31. Q31 · MCQ · 2 marks · Regular and Context-Free LanguagesWhich one of the following languages over = {a, b} is NOT context-free?

How many questions were in GATE CSE 2019?

GATE CSE 2019 had 31 questions for 37 marks: 22 MCQ, 0 MSQ and 9 NAT.

Which subject carried the most marks in GATE CSE 2019?

Engineering Mathematics carried the most marks (7 of 37). The top three were Engineering Mathematics (7), Programming and Data Structures (6), Digital Logic (5).

Where can I find the GATE CSE 2019 answer key?

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

Is the GATE CSE 2019 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 2018 question paper
• GATE CSE 2020 question paper
• All GATE CSE papers →
• GATE CSE Engineering Mathematics PYQs
• GATE CSE Programming and Data Structures PYQs
• GATE CSE Digital Logic PYQs