GATE CSE 2025 Session 1 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.
General Aptitude (Q1–Q10)
- Q1Articles: Ravi had __ younger brother who taught at __ universityGeneral Aptitude1M · MCQAns: A
- Q2Synonym of "myopic" in a sentence about a CEO's decisionGeneral Aptitude1M · MCQAns: B
- Q3Class size from a corrected averageGeneral Aptitude1M · MCQAns: C
- Q4Family relations among P, Q, R, S and TGeneral Aptitude1M · MCQAns: A
- Q5Directions on a campus mapGeneral Aptitude1M · MCQAns: C
- Q6Inference from Chesterton's "A Piece of Chalk"General Aptitude2M · MCQAns: C
- Q7Ratio of triangle PST to trapezium SQRTGeneral Aptitude2M · MCQAns: A
- Q8Probability of exactly one six in three rollsGeneral Aptitude2M · MCQAns: A
- Q9Pattern on a twice-folded square after cutsGeneral Aptitude2M · MCQAns: A
- Q10Ways to buy 3 scoops from 4 flavoursGeneral Aptitude2M · MCQAns: B
Computer Science and Information Technology (Q11–Q65)
- Q11Order of steps when an interrupt arrivesComputer Organization and Architecture1M · MCQAns: A
- Q12False statement about the symbol tableCompiler Design1M · MCQAns: C
- Q13Optimisation that uses live variable analysisCompiler Design1M · MCQAns: B
- Q14Page table entries for a 32-bit logical addressOperating System1M · MCQAns: A
- Q15Cascading rollback after T1 abortsDatabases1M · MCQAns: C
- Q16Match OSI layers with their functionsComputer Networks1M · MCQAns: B
- Q17What f and f∘g onto imply about gEngineering Mathematics1M · MCQAns: D
- Q18Shortest distances in a graph versus its MSTAlgorithms1M · MCQAns: B
- Q19Language generated by S → aaB | AbbTheory of Computation1M · MCQAns: A
- Q20Solve T(n) = 2T(n−1) + n·2^nAlgorithms1M · MCQAns: A
- Q21Effect of inserting 23 into a full B+ treeDatabases1M · MSQAns: B, D
- Q22TCP flags in the three-way handshakeComputer Networks1M · MSQAns: B, D
- Q23Values of k for which x + ky = 1, kx + y = −1 is solvableEngineering Mathematics1M · MSQAns: A, D
- Q24Identities of the 3-input majority functionDigital Logic1M · MSQAns: B, D
- Q25Sign-extended 2's complement forms of −6Digital Logic1M · MSQAns: B, D
- Q26True facts about any binary search treeProgramming and Data Structures1M · MSQAns: A, B
- Q27Operand combinations supported by a two-mux ALU datapathComputer Organization and Architecture1M · MSQAns: A, B, C
- Q28False statements about NFA and DFA sizesTheory of Computation1M · MSQAns: D
- Q29Times a process re-enters the ready queue due to I/OOperating System1M · NATAns: 21
- Q30Ternary strings of length 5 with a repeated adjacent symbolEngineering Mathematics1M · NATAns: 195
- Q31Value of b making a piecewise function differentiableEngineering Mathematics1M · NATAns: -2.1 to -1.9
- Q32Probability the coin is fake after two headsEngineering Mathematics1M · NATAns: 0.49 to 0.51
- Q33Swaps made by bubble sort on a reversed array of 30Algorithms1M · NATAns: 435
- Q34Output after writing through a pointer in a functionProgramming and Data Structures1M · NATAns: 25
- Q35Height of a min-heap with 32 keysProgramming and Data Structures1M · NATAns: 5
- Q36Total tag storage for a direct-mapped 16 KB cacheComputer Organization and Architecture2M · MCQAns: A
- Q37Largest immediate field in a 32-bit ADD instructionComputer Organization and Architecture2M · MCQAns: B
- Q38Average waiting time with two processors and different prioritiesOperating System2M · MCQAns: A
- Q39TRC query for players of team MIDatabases2M · MCQAns: A
- Q40Longest prefix match for 145.36.109.70Computer Networks2M · MCQAns: A
- Q41Eigenvalues of A^13 for a 2×2 matrixEngineering Mathematics2M · MCQAns: D
- Q42Minimise F = Σ(0, 2, 4, 8, 10, 11, 12)Digital Logic2M · MCQAns: A
- Q43BFS tree height when the graph diameter is 30Algorithms2M · MCQAns: C
- Q44Regularity of αβα languages over {a, b}Theory of Computation2M · MCQAns: C
- Q45Context-freeness of a^m b^m c^(m+n) and a^m b^n c^(m+n)Theory of Computation2M · MCQAns: C
- Q46Rules for computing FIRST and FOLLOW setsCompiler Design2M · MSQAns: A, D
- Q47Normal forms and lossless join for team(name, city, owner)Databases2M · MSQAns: B, C
- Q48Predicate logic for "Everyone has exactly one mother"Engineering Mathematics2M · MSQAns: B, D
- Q49Algebraic structure of functions under pointwise additionEngineering Mathematics2M · MSQAns: B
- Q50Language accepted by a four-state DFATheory of Computation2M · MSQAns: C
- Q51Internal fragmentation for a 1 MB file with linked allocationOperating System2M · NATAns: 65468
- Q52Number of basic blocks in a three-address codeCompiler Design2M · NATAns: 6
- Q53Average memory access time with two cache levelsComputer Organization and Architecture2M · NATAns: 11.83 to 11.87
- Q54Page faults with optimal replacement limited to 4-reference lookaheadOperating System2M · NATAns: 6
- Q55Minimum age of players coached by MarkDatabases2M · NATAns: 26
- Q56Probability a 5-bit message arrives error-freeComputer Networks2M · NATAns: 0.949 to 0.952
- Q57IPv4 fragments through routers with MTU 5000 and 3000Computer Networks2M · NATAns: 7
- Q58P(2 ≤ x ≤ 3) for density Cx² on [1, 4]Engineering Mathematics2M · NATAns: 0.3 to 0.302
- Q59Minimum states of an FSM from its state tableDigital Logic2M · NATAns: 5
- Q60Cycle length of a 4-flip-flop twisted ring counterDigital Logic2M · NATAns: 7 to 8
- Q61Recursive count of runs in an arrayProgramming and Data Structures2M · NATAns: 5
- Q62Nodes left in L1 after deleting values found in L2Programming and Data Structures2M · NATAns: 5
- Q63Output of gate(14362): keep alternate digitsProgramming and Data Structures2M · NATAns: 46
- Q64Largest x keeping edge BC in every MSTAlgorithms2M · NATAns: 5
- Q65Slot of key 24 under double hashingProgramming and Data Structures2M · NATAns: 10 to 11