GATE CSE 2024 Session 1 question paper with answers
Official paper organised by IISc Bangalore: 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)
- Q1Analogy by intensity: dry → arid → parched, diet → fast → ?General Aptitude1M · MCQAns: A
- Q2x/y when (x + y) is proportional to (x − y)General Aptitude1M · MCQAns: D
- Q3Median of a sample of ten numbersGeneral Aptitude1M · MCQAns: A
- Q4Share of money in ₹5 coins with coin ratio 5:3:13General Aptitude1M · MCQAns: C
- Q5Value of (p⁴ + q⁴)/(p²q²) from a log equationGeneral Aptitude1M · MCQAns: A
- Q6Fill four blanks: keep his head __ before heading __ to batGeneral Aptitude2M · MCQAns: C
- Q7Volume ratio of a rolled paper tube to a cube of equal areaGeneral Aptitude2M · MCQAns: A
- Q8Grams of fat from a pie chart of a 2,000 kcal dietGeneral Aptitude2M · MCQAns: C
- Q9Perimeter of a 20 cm × 8 cm sheet after three foldsGeneral Aptitude2M · MCQAns: A
- Q10Fewest squares to add so that AB is a line of symmetryGeneral Aptitude2M · MCQAns: A
Computer Science and Information Technology (Q11–Q65)
- Q11Points where max{x, x³} is not differentiableEngineering Mathematics1M · MCQAns: D
- Q12Product of eigenvalues of a 3 × 3 matrixEngineering Mathematics1M · MCQAns: B
- Q13Which 5-bit two's complement operation overflowsDigital Logic1M · MCQAns: B
- Q141 before 2 and 3 before 4 in a random permutationEngineering Mathematics1M · MCQAns: B
- Q15False statement about DMA, programmed I/O and interruptsComputer Organization and Architecture1M · MCQAns: C
- Q16Order of DNS, TCP SYN and HTTP GET packets when loading a pageComputer Networks1M · MCQAns: C
- Q17Worst-case complexity of a single-pass sortedness checkAlgorithms1M · MCQAns: A
- Q18Output of a C while loop with integer divisionProgramming and Data Structures1M · MCQAns: C
- Q19Recursive getchar/putchar on input 1234Programming and Data Structures1M · MCQAns: C
- Q20ER diagram for instructors, courses, students and classroomsDatabases1M · MCQAns: D
- Q21B+ tree node where half-full occupancy is relaxedDatabases1M · MCQAns: A
- Q22True statements about a relation in first normal formDatabases1M · MSQAns: A, C
- Q23Closure facts for regular and non-regular languagesTheory of Computation1M · MSQAns: C, D
- Q24True statements about threadsOperating System1M · MSQAns: D
- Q25Impossible process state transitionsOperating System1M · MSQAns: B, C
- Q26Which parsers are bottom-upCompiler Design1M · MSQAns: A, D
- Q27Independence and union/intersection probabilities of A and BEngineering Mathematics1M · MSQAns: B, C
- Q28Glitches in Y = X AND NOT X with gate delaysDigital Logic1M · MSQAns: A, C
- Q29Sequence and acknowledgement numbers in a TCP handshakeComputer Networks1M · MSQAns: A, D
- Q30Statements about operand forwarding in a 5-stage pipelineComputer Organization and Architecture1M · MSQAns: A, B, C
- Q31IP header fields changed by NAT on outgoing packetsComputer Networks1M · MSQAns: A, C
- Q32Possible |A| with bijections A → B and A × A → A ∪ BEngineering Mathematics1M · NATAns: 2
- Q33Evaluate an expression under unusual precedence and associativityCompiler Design1M · NATAns: 6
- Q34Number of spanning trees of K4Engineering Mathematics1M · NATAns: 16
- Q35Tuples in a selection over an equi-join of R and SDatabases1M · NATAns: 2
- Q36Time for a file split into chunks to cross a store-and-forward routerComputer Networks2M · MCQAns: B
- Q37Value computed by an SDD for the input MMLKCompiler Design2M · MCQAns: A
- Q38Complete a grammar from its FIRST and FOLLOW setsCompiler Design2M · MCQAns: A
- Q39Basic blocks in three-address code for a nested loopCompiler Design2M · MCQAns: D
- Q40Possible final values of a and b for two interleaved threadsOperating System2M · MCQAns: A
- Q41First three elements after heapifying an arrayProgramming and Data Structures2M · MCQAns: D
- Q42Solve T(n) = √n T(√n) + nAlgorithms2M · MCQAns: A
- Q43Possible positions of the maximum in a 105-element min-heapProgramming and Data Structures2M · MCQAns: A
- Q44Valid inferences of functional dependenciesDatabases2M · MSQAns: B, C, D
- Q45Edge types when a DFS tree is also a BFS treeAlgorithms2M · MSQAns: C
- Q46Serial schedules conflict-equivalent to a three-transaction scheduleDatabases2M · MSQAns: B, C, D
- Q47Equivalent forms of F = Σ(3, 5, 6, 7)Digital Logic2M · MSQAns: A, B
- Q48Return value bounds of a loop computing x = x + x + yProgramming and Data Structures2M · MSQAns: B, D
- Q49Solutions of Ax = 0 for a wide n × m matrixEngineering Mathematics2M · MSQAns: A
- Q50Distinguishable states in a 5-state DFATheory of Computation2M · MSQAns: B, C
- Q51Consequences of a graph having chromatic number kEngineering Mathematics2M · MSQAns: B, C
- Q52Associativity and distributivity of a ◊ b = a + 2b and a □ b = abEngineering Mathematics2M · MSQAns: B, D
- Q53Write-back vs write-through caches on hits and missesComputer Organization and Architecture2M · MSQAns: B, C
- Q54Number of cylinders in a 512 GB diskOperating System2M · NATAns: 4096
- Q55Core count minimising time with per-core overheadComputer Organization and Architecture2M · NATAns: 3
- Q56Speedup of a perfect cache given I-cache and D-cache miss ratesComputer Organization and Architecture2M · NATAns: 3
- Q57printf count for fork() inside a loop with wait()Operating System2M · NATAns: 14
- Q58Packets sent to R2 by longest-prefix matchComputer Networks2M · NATAns: 40
- Q59Derivation length for a 90-symbol string in Chomsky Normal FormTheory of Computation2M · NATAns: 179
- Q60Connected components from the size of a DFS forestAlgorithms2M · NATAns: 60
- Q61Strings of length ≤ 5 in neither 0* + 1* nor 01* + 10*Theory of Computation2M · NATAns: 44
- Q62Physical address of virtual address 2500 with 2 KB pagesOperating System2M · NATAns: 6596
- Q63Both balls red given the first is red (without replacement)Engineering Mathematics2M · NATAns: 0.37 to 0.38
- Q64Select-line combinations giving Y = 1 in a tree of 2-to-1 MUXesDigital Logic2M · NATAns: 4
- Q65Fragments delivered after two links with MTUs 542 and 360Computer Networks2M · NATAns: 6