Skip to content
GATEiit

GATE CSE 2026 Session 1 question paper with answers

Official paper organised by IIT Guwahati: 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. Q1Antonym of protagonistGeneral Aptitude1M · MCQAns: B
  2. Q2Which grid cannot be tiled by a 2×2 square and a 1×4 barGeneral Aptitude1M · MCQAns: C
  3. Q3Games needed in a 64-player knock-out tournamentGeneral Aptitude1M · MCQAns: C
  4. Q4Maximum elective credits under credit constraintsGeneral Aptitude1M · MCQAns: D
  5. Q5Statement not implied by 'teacher in room ⇒ students stand silently'General Aptitude1M · MCQAns: C
  6. Q6Inference from a passage on combinatorics in physical modelsGeneral Aptitude2M · MCQAns: B
  7. Q73D structure matching given front and top viewsGeneral Aptitude2M · MCQAns: D
  8. Q8Express a ramp function using max(S − K, 0) termsGeneral Aptitude2M · MCQAns: A
  9. Q9Javelin final: round of the bronze medallist's best throwGeneral Aptitude2M · MCQAns: A
  10. Q10Probability second die roll is a multiple of the firstGeneral Aptitude2M · MCQAns: C

Computer Science and Information Technology (Q11–Q65)

  1. Q11Pólya urn: equal red and blue after two stepsEngineering Mathematics1M · MCQAns: B
  2. Q124×4 binary matrices with even parity in every row and columnEngineering Mathematics1M · MCQAns: A
  3. Q13Maximum multiplicity of an eigenvalue of an n×n real matrixEngineering Mathematics1M · MCQAns: A
  4. Q14Match addressing modes with high-level data elementsComputer Organization and Architecture1M · MCQAns: B
  5. Q15Instruction sequence for Z = X + Y on a load-store machineComputer Organization and Architecture1M · MCQAns: D
  6. Q16Register dependency that causes a data hazardComputer Organization and Architecture1M · MCQAns: B
  7. Q17Solve nested recurrences T1 = 4T1(n/2) + T2, T2 = 5T2(n/4) + log nAlgorithms1M · MCQAns: A
  8. Q18True statement about TCP connection setup and closingComputer Networks1M · MCQAns: D
  9. Q19HTTP 1.1 persistent connections and pipeliningComputer Networks1M · MSQAns: A, C, D
  10. Q20Matrix with e2 in its null space: determinant and rankEngineering Mathematics1M · MSQAns: B, D
  11. Q21Expressions equivalent to (P̄ + Q) ⊕ (P̄Q)Digital Logic1M · MSQAns: A, C
  12. Q22Overflow with 8-bit sign-magnitude operandsDigital Logic1M · MSQAns: B, C
  13. Q23Non-leaf indices in a 1-indexed binary heap with n oddProgramming and Data Structures1M · MSQAns: B, C
  14. Q24Empty slots after linear-probing inserts with h(x) = (x+7) mod 11Programming and Data Structures1M · MSQAns: C
  15. Q25Ambiguity of S → aSbS | bS | εTheory of Computation1M · MSQAns: A, B, C
  16. Q26Impossible minimal DFA sizes for a 6-state NFATheory of Computation1M · MSQAns: B, D
  17. Q27Classify errors in three C string declarationsCompiler Design1M · MSQAns: C
  18. Q28True statements about LL(1) parsingCompiler Design1M · MSQAns: C
  19. Q29False statements about deadlocksOperating System1M · MSQAns: A, C
  20. Q30Which functional dependency inferences always holdDatabases1M · MSQAns: C, D
  21. Q31Dependency-preserving decompositions for 1NF, 2NF, 3NF, BCNFDatabases1M · MSQAns: A, B, C
  22. Q32Continuity at 0 of c1·e^x − c2·ln(1/x)Engineering Mathematics1M · NATAns: 3
  23. Q33Maximum height of a full binary tree with 23 nodesProgramming and Data Structures1M · NATAns: 11
  24. Q34Output of a C function with a shadowed block variableProgramming and Data Structures1M · NATAns: 9
  25. Q35Minimum resource instances for deadlock freedom (5 processes, max 2)Operating System1M · NATAns: 6
  26. Q36IEEE 754 single-precision sum of 35C00000 and 34A00000Computer Organization and Architecture2M · MCQAns: C
  27. Q37D flip-flop inputs for a 2-bit saturating up/down counterDigital Logic2M · MCQAns: B
  28. Q38Tag length: direct-mapped vs K-way set-associative cacheComputer Organization and Architecture2M · MCQAns: A
  29. Q39Recursive length of a non-empty singly linked listProgramming and Data Structures2M · MCQAns: B
  30. Q40Third insertion that can never yield a complete BST of 1..15Programming and Data Structures2M · MCQAns: D
  31. Q41Shortest paths with at most k edges: two statementsAlgorithms2M · MCQAns: A
  32. Q42Redundant (common) subexpressions in blocks B4 and B5 of a CFGCompiler Design2M · MCQAns: D
  33. Q43Relational algebra equivalent of a tuple calculus join queryDatabases2M · MCQAns: B
  34. Q44When segment 2000 is sent under TCP slow startComputer Networks2M · MCQAns: B
  35. Q45Minimum sliding window size for full link utilisationComputer Networks2M · MCQAns: B
  36. Q46Extrema and smoothness of (|x|/2 − x)(x − |x|/2)Engineering Mathematics2M · MSQAns: A, C, D
  37. Q47Condition forcing a vertex into every minimum vertex coverAlgorithms2M · MSQAns: A
  38. Q48Minimal SOP forms of Σm(1,2,3,4,5,7,10,12,13,14)Digital Logic2M · MSQAns: B, D
  39. Q49Cycle and cut properties of MSTs with distinct weightsAlgorithms2M · MSQAns: A, D
  40. Q50Impossible DFS discovery/finish orderings for a DAG edgeAlgorithms2M · MSQAns: B, D
  41. Q51What follows from L1 ∩ L2 and L2 being regularTheory of Computation2M · MSQAns: C
  42. Q52Counts of a's and b's in strings of a given CFGTheory of Computation2M · MSQAns: B, D
  43. Q53Compare two SDDs for type declarationsCompiler Design2M · MSQAns: A, B, D
  44. Q54Impossible TLB / page table / cache event sequencesComputer Organization and Architecture2M · MSQAns: B, C
  45. Q55Properties of 2-colorable (bipartite) graphsAlgorithms2M · MSQAns: B, C
  46. Q56Valid CIDR blocks for 6000 addresses inside 202.16.0.0/15Computer Networks2M · MSQAns: A, B, C
  47. Q57Number of matchings in a path on 8 verticesEngineering Mathematics2M · NATAns: 34
  48. Q58Expected value of a discrete random variable on 1..8Engineering Mathematics2M · NATAns: 4.24 to 4.26
  49. Q59Disk transfer time for random sectors on tracks 5, 12, 7Operating System2M · NATAns: 77.3
  50. Q60Structural-hazard stall cycles from a multi-cycle EX stageComputer Organization and Architecture2M · NATAns: 95
  51. Q61Smallest n for which foo(n) = 5 with foo(bar(n))Programming and Data Structures2M · NATAns: 65536
  52. Q62Postorder position of 60 in a BST given by its preorderProgramming and Data Structures2M · NATAns: 7
  53. Q63Number of printf calls with fork, continue and breakOperating System2M · NATAns: 4
  54. Q64Average FCFS waiting time for alternating A and C processesOperating System2M · NATAns: 9.5
  55. Q65Number of superkeys with candidate keys {A,B} and {A,C}Databases2M · NATAns: 6