GATE CSE 2024 Session 2 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)
- Q1Word in increasing intensity: bothered → ___ → dauntedGeneral Aptitude1M · MCQAns: C
- Q2Number of orders in which four elements can be mixedGeneral Aptitude1M · MCQAns: A
- Q3Students who like their core branch (Venn diagram)General Aptitude1M · MCQAns: A
- Q4Value of x/y + y/x from a logarithm equationGeneral Aptitude1M · MCQAns: C
- Q5Missing term in 6, 9, 14, x, 30, 41General Aptitude1M · MCQAns: B
- Q6Order four sentences about the HimalayasGeneral Aptitude2M · MCQAns: C
- Q7Net result of 10% profit and 10% loss at the same selling priceGeneral Aptitude2M · MCQAns: C
- Q8Percentage increase in renewable share from two pie chartsGeneral Aptitude2M · MCQAns: D
- Q9Minimum straight cuts to divide a cube into 8 equal piecesGeneral Aptitude2M · MCQAns: A
- Q10Fill the last row of a 4×4 neighbour-count gridGeneral Aptitude2M · MCQAns: A
Computer Science and Information Technology (Q11–Q65)
- Q11DMA transfer rate with cycle stealing at 1% of cyclesComputer Organization and Architecture1M · MCQAns: C
- Q12Translate 'fail grade cannot be given when…' into logicEngineering Mathematics1M · MCQAns: A
- Q13Output when function arguments are evaluated right to leftProgramming and Data Structures1M · MCQAns: A
- Q14Largest IEEE 754 single-precision bit patternComputer Organization and Architecture1M · MCQAns: B
- Q15Growth of T(n) = 5T(n−1) − 6T(n−2) with T(0)=1, T(1)=2Algorithms1M · MCQAns: A
- Q16Integral of f over [0, 2] when f(x) = 1 − f(2 − x)Engineering Mathematics1M · MCQAns: B
- Q17Graph whose adjacency matrix is its own inverseEngineering Mathematics1M · MCQAns: B
- Q18Probability six dice show all different numbersEngineering Mathematics1M · MCQAns: B
- Q19ACID property: committed effects survive a crashDatabases1M · MCQAns: A
- Q20Participation of weak and owner entity setsDatabases1M · MCQAns: A
- Q21Match compiler phases with what they produce or doCompiler Design1M · MCQAns: B
- Q22Regular expression for a two-state DFATheory of Computation1M · MCQAns: A
- Q23Destination IP and MAC addresses as a packet leaves the hostComputer Networks1M · MSQAns: B
- Q24Responsibilities of the MMU in a paging systemOperating System1M · MSQAns: B, C, D
- Q25Events that always move the running process out of runningOperating System1M · MSQAns: A, B
- Q26File organizations efficient for a full scanDatabases1M · MSQAns: A, B
- Q27True statements about two-phase lockingDatabases1M · MSQAns: A, C, D
- Q28Where IPv4 fragmentation and reassembly happenComputer Networks1M · MSQAns: B, C
- Q29False statements about SDDs and attribute evaluationCompiler Design1M · MSQAns: B, D
- Q30False Boolean identitiesDigital Logic1M · MSQAns: B, C
- Q31RAW, WAR and WAW dependencies in an instruction sequenceComputer Organization and Architecture1M · MSQAns: A
- Q32IPv4 header fields every router modifiesComputer Networks1M · MSQAns: C, D
- Q33Behaviour of a pointer-walking string length functionProgramming and Data Structures1M · MSQAns: A, B, D
- Q34Total orders extending a given partial order on {1,2,3,4}Engineering Mathematics1M · NATAns: 5
- Q35Minimum replacements to make an array non-decreasingAlgorithms1M · NATAns: 3
- Q36Pointer difference and value difference for a double arrayProgramming and Data Structures2M · MCQAns: B
- Q37Average waiting time under SRTF and non-preemptive SJFOperating System2M · MCQAns: B
- Q38CIDR prefix covering 10.12.2.0 to 10.12.3.255Computer Networks2M · MCQAns: A
- Q39What can be known about a BST from its set of keys aloneProgramming and Data Structures2M · MCQAns: A
- Q40Fill the missing cells of an LL(1) parsing tableCompiler Design2M · MCQAns: A
- Q41Regular expression for a 5-state NFA with ε-movesTheory of Computation2M · MCQAns: B
- Q42Missing expressions in longest two-distinct-value subarray codeProgramming and Data Structures2M · MCQAns: B
- Q43Missing triples for x[i] = (p + r) * −s[i] + u/wCompiler Design2M · MCQAns: A
- Q44Bound on the mean of a product of [0,1] random variablesEngineering Mathematics2M · MCQAns: D
- Q45Cross products needed for cities with at least 3 residentsDatabases2M · MCQAns: B
- Q46Possible outcomes of two threads using two semaphoresOperating System2M · MSQAns: B, C
- Q47Properties preserved when two rows of a matrix are swappedEngineering Mathematics2M · MSQAns: A, B
- Q48Output sequences possible with two bounded stacksProgramming and Data Structures2M · MSQAns: B, C, D
- Q49Numbers equal to 224 in base 5Digital Logic2M · MSQAns: A, B, D
- Q50Output of AND, OR and XOR of four minterm functionsDigital Logic2M · MSQAns: C, D
- Q51Edge weights when every spanning tree has even weightAlgorithms2M · MSQAns: D
- Q52Symbol-count relations for S → aS | aSbS | cTheory of Computation2M · MSQAns: B, C
- Q53Time to read 3000 randomly placed disk sectorsOperating System2M · NATAns: 29.5 to 30.5
- Q54TCP congestion window two RTTs after a timeoutComputer Networks2M · NATAns: 4
- Q55Minimum Ethernet frame size for collision detectionComputer Networks2M · NATAns: 500
- Q56Number of useful functional dependencies on 4 attributesDatabases2M · NATAns: 50
- Q57Opcodes per addressing mode in a 32-bit instructionComputer Organization and Architecture2M · NATAns: 32
- Q58Pipeline speedup with data and control hazard stallsComputer Organization and Architecture2M · NATAns: 2.9 to 3.1
- Q59Count the minimum spanning trees of a weighted graphAlgorithms2M · NATAns: 9
- Q60Chromatic number of an eight-vertex graphEngineering Mathematics2M · NATAns: 2
- Q61Field widths in R-type and I-type instruction formatsComputer Organization and Architecture2M · NATAns: 34
- Q62Strings of length at most 4 in b*ab*(ab*ab*)*Theory of Computation2M · NATAns: 15
- Q63Self-inverse elements of Z2 × Z3 × Z4Engineering Mathematics2M · NATAns: 4
- Q64Min and max page-table pages for 2000 pages in a 2-level tableOperating System2M · NATAns: 1028
- Q65Number of items in GOTO(I0, S) for an SLR grammarCompiler Design2M · NATAns: 9