Skip to content
GATEiit

GATE CSE 2025 Session 2 question paper with answers

Official paper organised by IIT Roorkee: 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. Q1Sentence completion: Rehman's ____ never waveredGeneral Aptitude1M · MCQAns: C
  2. Q2Analogy: Bird is to Nest as Bee is to ?General Aptitude1M · MCQAns: C
  3. Q3Constants P and Q with Pe^x = Qe^(−x) for all xGeneral Aptitude1M · MCQAns: A
  4. Q4Which cube is folded from the given paper netGeneral Aptitude1M · MCQAns: A
  5. Q5Which statement about two primes always holdsGeneral Aptitude1M · MCQAns: B
  6. Q6Inference from "Even if I had known … I would not have gone"General Aptitude2M · MCQAns: B
  7. Q7Letter coding: IMAGE → FHBNJ, FIELD → EMFJG, BEACH → ?General Aptitude2M · MCQAns: B
  8. Q8Recurrences that generate the X and Y output rowsGeneral Aptitude2M · MCQAns: A
  9. Q9Area of a rectangle PLMN drawn on a square PQRSGeneral Aptitude2M · MCQAns: D
  10. Q10Fewest bridges to connect five zones split by a riverGeneral Aptitude2M · MCQAns: C

Computer Science and Information Technology (Q11–Q65)

  1. Q11Eighth power of a 2×2 symmetric matrixEngineering Mathematics1M · MCQAns: C
  2. Q12Solve ∫₁ˣ t ln t dt = 1/4 for x > 1Engineering Mathematics1M · MCQAns: A
  3. Q13Internal nodes in a full binary tree with n nodesProgramming and Data Structures1M · MCQAns: B
  4. Q14Determinant of L^8 − L^2 when L^2 = L^(−1)Engineering Mathematics1M · MCQAns: A
  5. Q15Which predicate-logic formula is valid over the naturalsEngineering Mathematics1M · MCQAns: A
  6. Q16ARP mapping and TCP piggybacked acknowledgementsComputer Networks1M · MCQAns: B
  7. Q17Match routing protocols to their shortest-path algorithmsComputer Networks1M · MCQAns: A
  8. Q18Protocol that cannot appear in the IPv4 protocol fieldComputer Networks1M · MCQAns: D
  9. Q19Overlapping string copy without the terminating nullProgramming and Data Structures1M · MCQAns: D
  10. Q20Comparisons to find an element that is not the maximumAlgorithms1M · MCQAns: A
  11. Q21Backpatching for Boolean and flow-of-control codeCompiler Design1M · MCQAns: C
  12. Q22Classify three SDT rules as S-attributed or L-attributedCompiler Design1M · MCQAns: C
  13. Q23IPv4 fragments of a 7488-byte UDP payload over EthernetComputer Networks1M · MCQAns: D
  14. Q24Languages accepted by a deterministic PDATheory of Computation1M · MCQAns: A
  15. Q25Decidable question about context-free grammarsTheory of Computation1M · MCQAns: D
  16. Q26Average turnaround time under SRTF schedulingOperating System1M · MCQAns: D
  17. Q27ACID properties violated by a lost-update bank transferDatabases1M · MSQAns: B, C
  18. Q28What belongs to a processor's instruction set architectureComputer Organization and Architecture1M · MSQAns: D
  19. Q29True statements about BFS and DFS trees of an undirected graphAlgorithms1M · MSQAns: B, C, D
  20. Q30Match language classes to closure propertiesTheory of Computation1M · MSQAns: B, C
  21. Q31Output of a NAND, NOT, AND and OR gate circuitDigital Logic1M · MSQAns: A, B, C
  22. Q32Additions and subtractions in Booth's multiplicationComputer Organization and Architecture1M · NATAns: 13
  23. Q33Output of a subtraction loop on 126 and 105Programming and Data Structures1M · NATAns: 21
  24. Q34Clock frequency of a 4-bit ripple counterDigital Logic1M · NATAns: 250
  25. Q35Depth of node 19 in a binary search treeProgramming and Data Structures1M · NATAns: 4
  26. Q36Channel utilisation of stop-and-wait on a slow linkComputer Networks2M · MCQAns: A
  27. Q37MSTs and shortest paths after adding α to every edgeAlgorithms2M · MCQAns: C
  28. Q38Worst-case meld time for list, array heap and BSTProgramming and Data Structures2M · MCQAns: A
  29. Q39Main memory and cache size from tag and index bitsComputer Organization and Architecture2M · MCQAns: A
  30. Q40Is the grammar S → Aa | bAc | dc | bda SLR(1) or LALR(1)?Compiler Design2M · MCQAns: C
  31. Q41Comparisons needed to search a bitonic arrayAlgorithms2M · MCQAns: D
  32. Q42Pointwise order on functions from {1..n} to {0,1}Engineering Mathematics2M · MSQAns: B, C
  33. Q43Expressions equal to a four-variable K-mapDigital Logic2M · MSQAns: A, D
  34. Q44True statements about the LU decomposition P = LUEngineering Mathematics2M · MSQAns: A, B, C
  35. Q45Supporting an O(1) MIN operation on a stackProgramming and Data Structures2M · MSQAns: A
  36. Q46Which of two relations with given FDs are in 3NFDatabases2M · MSQAns: C, D
  37. Q47Identify the page replacement policy from a frame traceOperating System2M · MSQAns: D
  38. Q48Which process aborts make a resource graph deadlock-freeOperating System2M · MSQAns: C, D
  39. Q49Relations among three IEEE 754 single-precision valuesComputer Organization and Architecture2M · MSQAns: A, B, C
  40. Q50Which Boolean algebra identities are correctDigital Logic2M · MSQAns: B, C, D
  41. Q51LL(1) and ambiguity of two if-then-else grammarsCompiler Design2M · MSQAns: C, D
  42. Q52Which counting-based languages are regularTheory of Computation2M · MSQAns: A, C
  43. Q53Which interleavings of T1 and T2 are conflict serializableDatabases2M · MSQAns: B
  44. Q54SQL queries for names of students enrolled in course 1470Databases2M · MSQAns: A, C, D
  45. Q55Average memory access time with two cache levelsComputer Organization and Architecture2M · NATAns: 4
  46. Q56Time for 1000 instructions on a 5-stage pipeline with latchesComputer Organization and Architecture2M · NATAns: 260.2 to 261.2
  47. Q57Parent of leaf 25* after inserting 23 into a B+ treeDatabases2M · NATAns: 33
  48. Q58Outer page table index bits in two-level pagingOperating System2M · NATAns: 11
  49. Q59Output of the double-BFS algorithm on a given treeAlgorithms2M · NATAns: 6
  50. Q60Minimal DFA for strings whose digit product mod 7 is 2Theory of Computation2M · NATAns: 6
  51. Q61Clock cycle duration from an instruction mixComputer Organization and Architecture2M · NATAns: 3
  52. Q62Pointer arithmetic and increment through a pointerProgramming and Data Structures2M · NATAns: 111
  53. Q63Sum of nested function calls in a loopProgramming and Data Structures2M · NATAns: 46
  54. Q64Probability of equal roots in a square-invariant quadraticEngineering Mathematics2M · NATAns: 0.5
  55. Q65Expected length of the piece of (0,1) containing 0.4Engineering Mathematics2M · NATAns: 0.7 to 0.8