Skip to content
GATEiit

GATE CSE 2023 question paper with answers

Official paper organised by IIT Kanpur: 65 questions, 100 marks. Every answer is from the official final answer key. Open any question to try it, see the answer and the concept behind it.

Practise this paper free →Official question paper (PDF)Official answer key (PDF)

General Aptitude (Q1–Q10)

  1. Q1Fill the blank: reached the station late, and ___ missed the trainGeneral Aptitude1M · MCQAns: B
  2. Q2Word analogy: Kind : ___ :: Often : FrequentlyGeneral Aptitude1M · MCQAns: Marks to all
  3. Q3First term of a Fibonacci-type series given F6 = 37 and F7 = 60General Aptitude1M · MCQAns: A
  4. Q4Share of pregnant women who saw a doctor at least onceGeneral Aptitude1M · MCQAns: A
  5. Q5Shape of the surface of a smooth 3-D objectGeneral Aptitude1M · MCQAns: C
  6. Q6Zombieland: what the bicycle incentive impliesGeneral Aptitude2M · MCQAns: D
  7. Q7Comparing f(t) = 0.01t² and g(t) = 4tGeneral Aptitude2M · MCQAns: C
  8. Q8Order four sentences about Mina into a coherent narrativeGeneral Aptitude2M · MCQAns: D
  9. Q9f(x) ≡ g(y) for all real x and yGeneral Aptitude2M · MCQAns: B
  10. Q10Rotation then reflection taking star P to Q to RGeneral Aptitude2M · MCQAns: A

Computer Science and Information Technology (Q11–Q65)

  1. Q11Front-end and back-end of a compilerCompiler Design1M · MCQAns: B
  2. Q12Which array A[1..10] is a max-heapProgramming and Data Structures1M · MCQAns: B
  3. Q13Worst-case node deletion in singly vs doubly linked listsProgramming and Data Structures1M · MCQAns: D
  4. Q14Regular expression for a four-state DFATheory of Computation1M · MCQAns: C
  5. Q15Closed form of the Lucas sequence with L1 = 1, L2 = 3Engineering Mathematics1M · MCQAns: A
  6. Q16Meaning of the degree (arity) of a relationDatabases1M · MCQAns: A
  7. Q17When is Stop-and-Wait link utilization lowestComputer Networks1M · MCQAns: B
  8. Q18Relation between det(A) and det(B) for row-permuted matricesEngineering Mathematics1M · MCQAns: B
  9. Q19ε-NFA accepting identifiers letter (letter | digit)*Compiler Design1M · MCQAns: C
  10. Q20Hashing strategy against an adversary maximising collisionsProgramming and Data Structures1M · MCQAns: C
  11. Q212-input multiplexer with output fed back to input 0Digital Logic1M · MCQAns: B
  12. Q22What to save on a switch between threads of one processOperating System1M · MSQAns: B, C, D
  13. Q23Events that guarantee a switch from user to kernel modeOperating System1M · MSQAns: C, D
  14. Q24Closure of language classes under intersectionTheory of Computation1M · MSQAns: A, C, D
  15. Q25Incorrect statements about OSPFComputer Networks1M · MSQAns: A, C
  16. Q26Statements that imply ∀x (P(x) ⇒ ∃y Q(x, y))Engineering Mathematics1M · MSQAns: B, C
  17. Q27CPU scheduling algorithms that can cause starvationOperating System1M · MSQAns: C, D (or A, C, D)
  18. Q28Local extrema of f(x) = x³ + 15x² − 33x − 36Engineering Mathematics1M · MSQAns: B, D
  19. Q29Asymptotic relations between f(n) = n and g(n) = n²Algorithms1M · MSQAns: A, C
  20. Q30Sum of eigenvalues of a graph's adjacency matrix with self-loopsEngineering Mathematics1M · NATAns: 2 (or 4)
  21. Q31Triple integral of 4x²y − z³ over a symmetric boxEngineering Mathematics1M · NATAns: 0
  22. Q32Convert 132 from radix 4 to radix 5Digital Logic1M · NATAns: 110
  23. Q33Time for 100 instructions on a 3-stage pipelineComputer Organization and Architecture1M · NATAns: 2040
  24. Q34Polling vs interrupt overhead for keyboard inputComputer Organization and Architecture1M · NATAns: 10.2
  25. Q35Output of a C program using a static local variableProgramming and Data Structures1M · NATAns: 7
  26. Q36Activation tree of main for recursive calls to f2Compiler Design2M · MCQAns: A
  27. Q37Live variables at the exit of each block of a flow graphCompiler Design2M · MCQAns: D
  28. Q38Minimum final X with binary vs counting semaphoreOperating System2M · MCQAns: C
  29. Q39Language of S → aSb | X, X → aX | Xb | a | bTheory of Computation2M · MCQAns: B
  30. Q40Language accepted by empty stack by a three-state PDATheory of Computation2M · MCQAns: A
  31. Q41Fill operands U1–U4 in assembly for a[i] = b[i] * 8Computer Organization and Architecture2M · MCQAns: B
  32. Q42Starting addresses of memory blocks selected by IA4 and IA3Computer Organization and Architecture2M · MCQAns: C
  33. Q43State never reached by a T–D–T flip-flop circuitDigital Logic2M · MCQAns: A
  34. Q44Multiplexer inputs realising A' + A'C' + AB'CDigital Logic2M · MCQAns: C
  35. Q45IEEE-754 product of 0xC1800000 and 0x3F5C2EF4Digital Logic2M · MCQAns: C
  36. Q46Worst-case Extract-Max and Insert on a max-heapProgramming and Data Structures2M · MCQAns: B
  37. Q47Output of a recursive subtree-sum function on a binary treeProgramming and Data Structures2M · MCQAns: C
  38. Q48Permutations of U that separate set A from set BEngineering Mathematics2M · MCQAns: D
  39. Q49Map F([x]) = f(x) on equivalence classes of an onto fEngineering Mathematics2M · MSQAns: B, C, D
  40. Q50Valid sequence number field lengths for a TCP-like protocolComputer Networks2M · MSQAns: B, C, D
  41. Q51Power set under symmetric difference as a groupEngineering Mathematics2M · MSQAns: A, D
  42. Q52RTTs to load a page with iterative DNS and 10 objectsComputer Networks2M · MSQAns: C, D
  43. Q53Independence of events for two fair coin tossesEngineering Mathematics2M · MSQAns: C, D
  44. Q54Comparing a halving loop with a 100n loopAlgorithms2M · MSQAns: A, D
  45. Q55Greedy vertex colouring: properness and colour countEngineering Mathematics2M · MSQAns: A, B
  46. Q56Number of BFS orderings from ∅ in the subset graph of {1, 2, 3}Algorithms2M · NATAns: 5040
  47. Q57LRU page faults for column-wise access of int D[128][128]Operating System2M · NATAns: 4096
  48. Q58Levels of page table for 57-bit virtual addressesOperating System2M · NATAns: 5
  49. Q59Top of stack after mixed stack and queue operationsProgramming and Data Structures2M · NATAns: 8
  50. Q60Value of 10#011 under a binary-fraction translation schemeCompiler Design2M · NATAns: 2.374 to 2.376
  51. Q61Rows returned by SELECT with gender = 'F' AND marks > 65Databases2M · NATAns: 2
  52. Q62Block accesses with a sparse primary index and binary searchDatabases2M · NATAns: 6
  53. Q63Minimum DFA states for strings without three consecutive 1sTheory of Computation2M · NATAns: 4
  54. Q64TAG bits of a 64 KB 8-way set-associative cacheComputer Organization and Architecture2M · NATAns: 19
  55. Q65Longest prefix match for 200.150.68.118Computer Networks2M · NATAns: 3