GATE CSE 2024 Set 1 Question Paper with Solutions & Answer Key
All 65 questions of the GATE CSE 2024 Set 1 paper (100 marks: 30 one-mark and 35 two-mark; 29 MCQ, 20 MSQ, 16 NAT), with the answer key and a verified solution for each. See more GATE CSE question papers or all GATE CSE PYQs.
- Questions
- 65
- Total marks
- 100
- MCQ / MSQ / NAT
- 29 / 20 / 16
- Topics
- 42
GATE CSE 2024 Set 1 paper analysis
Engineering Mathematics and General Aptitude together made up 31 of 100 marks, down 2 from GATE CSE 2023. 16 of 65 questions were NAT, the most since 2023. Cache Memory and Hierarchy was the heaviest single topic with 8 marks across 4 questions. Databases moved the most against GATE CSE 2023: up 3 marks.
All GATE CSE 2024 Set 1 questions
Each question opens its full verified solution.
- Q1 · MCQ · 1 mark · Verbal AptitudeIf '→' denotes increasing order of intensity, then the meaning of the words [dry → arid → parched] is analogous to [diet → fast → … ]. Which one of the given options is…
- Q2 · MCQ · 1 mark · Quantitative AptitudeIf two distinct non-zero real variables x and y are such that (x + y) is proportional to (x - y) then the value of (x)/(y)
- Q3 · MCQ · 1 mark · Quantitative AptitudeConsider the following sample of numbers: 9, 18, 11, 14, 15, 17, 10, 69, 11, 13 The median of the sample is
- Q4 · MCQ · 1 mark · Quantitative AptitudeThe number of coins of ₹1, ₹5, and ₹10 denominations that a person has are in the ratio 5:3:13. Of the total amount, the percentage of money in ₹5 coins is
- Q5 · MCQ · 1 mark · Quantitative AptitudeFor positive non-zero real variables p and q, if log (p2 + q2 ) = log p + log q + 2 log 3 , then, the value of (p4+q4)/(p2 q2) is
- Q6 · MCQ · 2 marks · Verbal AptitudeIn the given text, the blanks are numbered (i)–(iv). Select the best match for all the blanks. Steve was advised to keep his head … (i) … before heading … (ii) … to bat;…
- Q7 · MCQ · 2 marks · Quantitative AptitudeA rectangular paper sheet of dimensions 54 cm × 4 cm is taken. The two longer edges of the sheet are joined together to create a cylindrical tube. A cube whose surface a…
- Q8 · MCQ · 2 marks · Data InterpretationThe pie chart presents the percentage contribution of different macronutrients to a typical 2,000 kcal diet of a person. The typical energy density (kcal/g) of these mac…
- Q9 · MCQ · 2 marks · Spatial AptitudeA rectangular paper of 20 cm × 8 cm is folded 3 times. Each fold is made along the line of symmetry, which is perpendicular to its long edge. The perimeter of the final…
- Q10 · MCQ · 2 marks · Spatial AptitudeThe least number of squares to be added in the figure to make AB a line of symmetry is
- Q11 · MCQ · 1 mark · CalculusLet f R → R be a function such that f(x) = max{x, x3}, x ∈ R, where R is the set of all real numbers. The set of all points where f(x) is NOT differentiable is
- Q12 · MCQ · 1 mark · Linear AlgebraThe product of all eigenvalues of the matrix 1 & 2 & 3 4 & 5 & 6 7 & 8 & 9 is
- Q13 · MCQ · 1 mark · Number Representation and ArithmeticConsider a system that uses 5 bits for representing signed integers in 2’s complement format. In this system, two integers A and B are represented as A=01010 and B=11010…
- Q14 · MCQ · 1 mark · Probability and StatisticsConsider a permutation sampled uniformly at random from the set of all permutations of {1, 2, 3, , n} for some n ≥ 4. Let X be the event that 1 occurs before 2 in the pe…
- Q15 · MCQ · 1 mark · I/O Interface, Interrupts and DMAWhich one of the following statements is FALSE?
- Q16 · MCQ · 1 mark · DNS and HTTPA user starts browsing a webpage hosted at a remote server. The browser opens a single TCP connection to fetch the entire webpage from the server. The webpage consists o…
- Q17 · MCQ · 1 mark · Asymptotic AnalysisGiven an integer array of size N, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single…
- Q18 · MCQ · 1 mark · Programming in CConsider the following C program: #include int main() { int a = 6; int b = 0; while(a Which one of the following statements is CORRECT?
- Q19 · MCQ · 1 mark · RecursionConsider the following C program: #include void fX(); int main(){ fX(); return 0; } void fX(){ char a; if((a=getchar()) != ' ') fX(); if(a != ' ') putchar(a); } Assume t…
- Q20 · MCQ · 1 mark · ER ModelLet S be the specification: "Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students." Which one of the fo…
- Q21 · MCQ · 1 mark · File Organization and IndexingIn a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
- Q22 · MSQ · 1 mark · Integrity Constraints and Normal FormsWhich of the following statements about a relation R in first normal form (1NF) is/are TRUE ?
- Q23 · MSQ · 1 mark · Regular and Context-Free LanguagesLet L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
- Q24 · MSQ · 1 mark · Processes, Threads and IPCWhich of the following statements about threads is/are TRUE?
- Q25 · MSQ · 1 mark · Processes, Threads and IPCWhich of the following process state transitions is/are NOT possible?
- Q26 · MSQ · 1 mark · ParsingWhich of the following is/are Bottom-Up Parser(s)?
- Q27 · MSQ · 1 mark · Probability and StatisticsLet A and B be two events in a probability space with P(A) = 0.3, P(B) = 0.5, and P(A ∩ B) = 0.1. Which of the following statements is/are TRUE?
- Q28 · MSQ · 1 mark · Boolean Algebra and MinimizationConsider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no delays. Whi…
- Q29 · MSQ · 1 mark · TCP Flow and Congestion ControlTCP client P successfully establishes a connection to TCP server Q. Let NP denote the sequence number in the SYN sent from P to Q. Let NQ denote the acknowledgement numb…
- Q30 · MSQ · 1 mark · Instruction PipeliningConsider a 5-stage pipelined processor with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback (WB) stages. Which…
- Q31 · MSQ · 1 mark · Network Address TranslationWhich of the following fields is/are modified in the IP header of a packet going out of a network address translation (NAT) device from an internal network to an externa…
- Q32 · NAT · 1 mark · Sets, Relations and FunctionsLet A and B be non-empty finite sets such that there exist one-to-one and onto functions (i) from A to B and (ii) from A × A to A ∪ B. The number of possible values of |…
- Q33 · NAT · 1 mark · Programming in CConsider the operator precedence and associativity rules for the integer arithmetic operators given in the table below. The value of the expression 3 + 1 + 5 * 2 / 7 + 2…
- Q34 · NAT · 1 mark · Graph TheoryThe number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is …
- Q35 · NAT · 1 mark · Relational AlgebraConsider the following two relations, R(A,B) and S(A,C): The total number of tuples obtained by evaluating the following expression B < C(R R.A=S.A S) is …
- Q36 · MCQ · 2 marks · Switching and Performance MetricsConsider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size 106 bytes to R via this path by splitting the file into chunks of 103 bytes…
- Q37 · MCQ · 2 marks · Syntax-Directed TranslationConsider the following syntax-directed definition (SDD). Given "MMLK" as the input, which one of the following options is the CORRECT value computed by the SDD (in the a…
- Q38 · MCQ · 2 marks · ParsingConsider the following grammar G, with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), and (3). S → daT (1) T → aS bT (2) R →…
- Q39 · MCQ · 2 marks · Intermediate Code GenerationConsider the following pseudo-code. L1: t1 = -1 L2: t2 = 0 L3: t3 = 0 L4: t4 = 4 * t3 L5: t5 = 4 * t2 L6: t6 = t5 * M L7: t7 = t4 + t6 L8: t8 = a[t7] L9: if t8 Which one…
- Q40 · MCQ · 2 marks · Concurrency and SynchronizationConsider the following two threads T1 and T2 that update two shared variables a and b. Assume that initially a = b = 1. Though context switching between threads can happ…
- Q41 · MCQ · 2 marks · Binary HeapsAn array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the following options represents the first three elements in the heapified array?
- Q42 · MCQ · 2 marks · Asymptotic AnalysisConsider the following recurrence relation: T(n) = √(n) T(√(n)) + n & for n ≥ 1, 1 & for n = 1. Which one of the following options is CORRECT?
- Q43 · MCQ · 2 marks · Binary HeapsConsider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possib…
- Q44 · MSQ · 2 marks · Integrity Constraints and Normal FormsThe symbol → indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
- Q45 · MSQ · 2 marks · Graph TraversalsLet G be a directed graph and T a depth first search (DFS) spanning tree in G that is rooted at a vertex v. Suppose T is also a breadth first search (BFS) tree in G, roo…
- Q46 · MSQ · 2 marks · Transactions and Concurrency ControlConsider the following read-write schedule S over three transactions T1, T2, and T3, where the subscripts in the schedule indicate transaction IDs: S: r1(z); w1(z); r2(x…
- Q47 · MSQ · 2 marks · Boolean Algebra and MinimizationConsider a Boolean expression given by F(X, Y, Z) = (3, 5, 6, 7). Which of the following statements is/are CORRECT?
- Q48 · MSQ · 2 marks · Programming in CConsider the following C function definition. int f(int x, int y) { for (int i=0; i Which of the following statements is/are TRUE about the above function?
- Q49 · MSQ · 2 marks · Linear AlgebraLet A be any n × m matrix, where m > n. Which of the following statements is/are TRUE about the system of linear equations Ax = 0 ?
- Q50 · MSQ · 2 marks · Regular Expressions and Finite AutomataConsider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0's in w and n1(w) be the number of…
- Q51 · MSQ · 2 marks · Graph TheoryThe chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let G be any graph with n vertices and chromatic number k. Whic…
- Q52 · MSQ · 2 marks · Sets, Relations, Lattices and GroupsConsider the operators and defined by a b = a + 2b, a b = ab, for positive integers. Which of the following statements is/are TRUE?
- Q53 · MSQ · 2 marks · Cache Memory and HierarchyConsider two set-associative cache memory architectures: WBC, which uses the write back policy, and WTC, which uses the write through policy. Both of them use the LRU (…
- Q54 · NAT · 2 marks · Cache Memory and HierarchyConsider a 512 GB hard disk with 32 storage surfaces. There are 4096 sectors per track and each sector holds 1024 bytes of data. The number of cylinders in the hard disk…
- Q55 · NAT · 2 marks · Cache Memory and HierarchyThe baseline execution time of a program on a 2 GHz single core machine is 100 nanoseconds ( ns). The code corresponding to 90% of the execution time can be fully parall…
- Q56 · NAT · 2 marks · Cache Memory and HierarchyA given program has 25% load/store instructions. Suppose the ideal CPI (cycles per instruction) without any memory stalls is 2. The program exhibits 2% miss rate on inst…
- Q57 · NAT · 2 marks · System CallsConsider the following code snippet using the fork() and wait() system calls. Assume that the code compiles and runs correctly, and that the system calls run successfull…
- Q58 · NAT · 2 marks · CIDR NotationConsider the entries shown below in the forwarding table of an IP router. Each entry consists of an IP prefix and the corresponding next hop router for packets whose des…
- Q59 · NAT · 2 marks · Context-Free Grammars and PDAsLet G = (V, , S, P) be a context-free grammar in Chomsky Normal Form with = {a, b, c} and V containing 10 variable symbols including the start symbol S. The string w = a…
- Q60 · NAT · 2 marks · Graph TheoryThe number of edges present in the forest generated by the DFS traversal of an undirected graph G with 100 vertices is 40. The number of connected components in G is …
- Q61 · NAT · 2 marks · Regular Expressions and Finite AutomataConsider the following two regular expressions over the alphabet {0,1}: r = 0* + 1* s = 01* + 10* The total number of strings of length less than or equal to 5, which ar…
- Q62 · NAT · 2 marks · Memory Management and Virtual MemoryConsider a memory management system that uses a page size of 2 KB. Assume that both the physical and virtual addresses start from 0. Assume that the pages 0, 1, 2, and 3…
- Q63 · NAT · 2 marks · Probability and StatisticsA bag contains 10 red balls and 15 blue balls. Two balls are drawn randomly without replacement. Given that the first ball drawn is red, the probability (rounded off to…
- Q64 · NAT · 2 marks · Combinational and Sequential CircuitsConsider a digital logic circuit consisting of three 2-to-1 multiplexers M1, M2, and M3 as shown below. X1 and X2 are inputs of M1. X3 and X4 are inputs of M2. A, B, and…
- Q65 · NAT · 2 marks · IPv4 FragmentationConsider sending an IP datagram of size 1420 bytes (including 20 bytes of IP header) from a sender to a receiver over a path of two links with a router between them. The…
GATE CSE 2024 Set 1 answer key
Official answers. Open a question for the full solution.
| Q | Type | Marks | Answer | Topic |
|---|---|---|---|---|
| Q1 | MCQ | 1 | A | Verbal Aptitude |
| Q2 | MCQ | 1 | D | Quantitative Aptitude |
| Q3 | MCQ | 1 | A | Quantitative Aptitude |
| Q4 | MCQ | 1 | C | Quantitative Aptitude |
| Q5 | MCQ | 1 | A | Quantitative Aptitude |
| Q6 | MCQ | 2 | C | Verbal Aptitude |
| Q7 | MCQ | 2 | A | Quantitative Aptitude |
| Q8 | MCQ | 2 | C | Data Interpretation |
| Q9 | MCQ | 2 | A | Spatial Aptitude |
| Q10 | MCQ | 2 | A | Spatial Aptitude |
| Q11 | MCQ | 1 | D | Calculus |
| Q12 | MCQ | 1 | B | Linear Algebra |
| Q13 | MCQ | 1 | B | Number Representation and Arithmetic |
| Q14 | MCQ | 1 | B | Probability and Statistics |
| Q15 | MCQ | 1 | C | I/O Interface, Interrupts and DMA |
| Q16 | MCQ | 1 | C | DNS and HTTP |
| Q17 | MCQ | 1 | A | Asymptotic Analysis |
| Q18 | MCQ | 1 | C | Programming in C |
| Q19 | MCQ | 1 | C | Recursion |
| Q20 | MCQ | 1 | D | ER Model |
| Q21 | MCQ | 1 | A | File Organization and Indexing |
| Q22 | MSQ | 1 | A, C | Integrity Constraints and Normal Forms |
| Q23 | MSQ | 1 | C, D | Regular and Context-Free Languages |
| Q24 | MSQ | 1 | D | Processes, Threads and IPC |
| Q25 | MSQ | 1 | B, C | Processes, Threads and IPC |
| Q26 | MSQ | 1 | A, D | Parsing |
| Q27 | MSQ | 1 | B, C | Probability and Statistics |
| Q28 | MSQ | 1 | A, C | Boolean Algebra and Minimization |
| Q29 | MSQ | 1 | A, D | TCP Flow and Congestion Control |
| Q30 | MSQ | 1 | A, B, C | Instruction Pipelining |
| Q31 | MSQ | 1 | A, C | Network Address Translation |
| Q32 | NAT | 1 | 2 | Sets, Relations and Functions |
| Q33 | NAT | 1 | 6 | Programming in C |
| Q34 | NAT | 1 | 16 | Graph Theory |
| Q35 | NAT | 1 | 2 | Relational Algebra |
| Q36 | MCQ | 2 | B | Switching and Performance Metrics |
| Q37 | MCQ | 2 | A | Syntax-Directed Translation |
| Q38 | MCQ | 2 | A | Parsing |
| Q39 | MCQ | 2 | D | Intermediate Code Generation |
| Q40 | MCQ | 2 | A | Concurrency and Synchronization |
| Q41 | MCQ | 2 | D | Binary Heaps |
| Q42 | MCQ | 2 | A | Asymptotic Analysis |
| Q43 | MCQ | 2 | A | Binary Heaps |
| Q44 | MSQ | 2 | B, C, D | Integrity Constraints and Normal Forms |
| Q45 | MSQ | 2 | C | Graph Traversals |
| Q46 | MSQ | 2 | B, C, D | Transactions and Concurrency Control |
| Q47 | MSQ | 2 | A, B | Boolean Algebra and Minimization |
| Q48 | MSQ | 2 | B, D | Programming in C |
| Q49 | MSQ | 2 | A | Linear Algebra |
| Q50 | MSQ | 2 | B, C | Regular Expressions and Finite Automata |
| Q51 | MSQ | 2 | B, C | Graph Theory |
| Q52 | MSQ | 2 | B, D | Sets, Relations, Lattices and Groups |
| Q53 | MSQ | 2 | B, C | Cache Memory and Hierarchy |
| Q54 | NAT | 2 | 4096 | Cache Memory and Hierarchy |
| Q55 | NAT | 2 | 3 | Cache Memory and Hierarchy |
| Q56 | NAT | 2 | 3 | Cache Memory and Hierarchy |
| Q57 | NAT | 2 | 14 | System Calls |
| Q58 | NAT | 2 | 40 | CIDR Notation |
| Q59 | NAT | 2 | 179 | Context-Free Grammars and PDAs |
| Q60 | NAT | 2 | 60 | Graph Theory |
| Q61 | NAT | 2 | 44 | Regular Expressions and Finite Automata |
| Q62 | NAT | 2 | 6596 | Memory Management and Virtual Memory |
| Q63 | NAT | 2 | 0.375 | Probability and Statistics |
| Q64 | NAT | 2 | 4 | Combinational and Sequential Circuits |
| Q65 | NAT | 2 | 6 | IPv4 Fragmentation |
Subject-wise weightage
Where the marks came from in GATE CSE 2024 Set 1, against GATE CSE 2023 and the average paper.
| Subject | Qs | Marks | Share | vs previous year | Avg marks / paper |
|---|---|---|---|---|---|
| GATE CSE Engineering Mathematics PYQs | 11 | 16 | 16% | -2 | 14.8 |
| GATE CSE General Aptitude PYQs | 10 | 15 | 15% | 0 | 7.4 |
| GATE CSE Computer Organization and Architecture PYQs | 6 | 10 | 10% | +2 | 6.8 |
| GATE CSE Computer Networks PYQs | 6 | 9 | 9% | +1 | 7.6 |
| GATE CSE Programming and Data Structures PYQs | 6 | 9 | 9% | 0 | 9.5 |
| GATE CSE Databases PYQs | 6 | 8 | 8% | +3 | 6.8 |
| GATE CSE Operating Systems PYQs | 5 | 8 | 8% | -1 | 7.4 |
| GATE CSE Theory of Computation PYQs | 4 | 7 | 7% | -1 | 6.9 |
| GATE CSE Compiler Design PYQs | 4 | 7 | 7% | -1 | 5.2 |
| GATE CSE Digital Logic PYQs | 4 | 6 | 6% | -2 | 5.5 |
| GATE CSE Algorithms PYQs | 3 | 5 | 5% | +1 | 7.2 |
GATE CSE 2024 Set 1 FAQ
- How many questions were in GATE CSE 2024 Set 1?
- GATE CSE 2024 Set 1 had 65 questions for 100 marks: 29 MCQ, 20 MSQ and 16 NAT.
- Which subject carried the most marks in GATE CSE 2024 Set 1?
- Engineering Mathematics carried the most marks (16 of 100). The top three were Engineering Mathematics (16), General Aptitude (15), Computer Organization and Architecture (10).
- Where can I find the GATE CSE 2024 Set 1 answer key?
- The answer key table on this page lists the answer to every question of GATE CSE 2024 Set 1. Open any question for its full verified solution.
- Is the GATE CSE 2024 Set 1 paper useful for GATE 2027 preparation?
- Yes. Solving past GATE CSE papers shows how marks are spread across subjects and which topics repeat. Compare it with other GATE CSE question papers and the topic-wise GATE CSE PYQs.