GATE CS 2024 Previous Year Question Paper

The 2 official GATE CS 2024 question papers and 2 answer keys are on this page as PDFs from IISc Bangalore, with the original source linked beside each file. The GATE CS exam covers General Aptitude, Engineering Mathematics and CS core. Download them below, then sit the paper under exam timing with the attempt plan and error-log routine on this page.

Explore: GATE CS hub · Topic-wise PYQs · Syllabus & pattern · GATE CS 2025 · How to use PYQs

Why this year matters

GATE CS 2024 still sits close to the current pattern. Use it after the newest year so you are not learning process and content on the same day. Download only your paper code. Mixed-branch dumps wreck weightage learning.

After the paper, rebuild a short chapter-weight list for your code. NAT digit errors are silly misses if the setup was right; log them that way so you fix keystroke discipline, not concepts that were already fine.

Paper analysis

Snapshot of GATE CS 2024

GATE CS 2024 (CS1): 65 questions for 100 marks, made up of 29 MCQ, 20 MSQ and 16 NAT. General Aptitude is 15 marks and Engineering Mathematics 8, which leaves 77 for the computer science subjects. Every question is tagged on the GATE CS topic pages.

Subject-wise marks

What this paper stresses

• Operating Systems led the paper with 10 marks, ahead of Computer Networks (9) and Engineering Mathematics (8).
• Lighter than usual: Programming & Data Structures 8 against 10.7; Discrete Mathematics 6 against 8.6.
• 16 NAT questions worth 28 marks: exact values, no options to eliminate.
• 20 MSQ questions worth 30 marks. MSQ has no negative marking, but one wrong extra option scores zero.
• Concepts that keep coming back and appear here: Calculus (11/11 years), Linear Algebra (11/11 years), Context-Free Languages (11/11 years), Number Representation (10/11 years), Probability (10/11 years).
• Asked in this paper only (of the 11 we tagged): Performance & Speedup.

What to extract before you move on

• Your marks per subject next to the table above. A gap in a heavy subject costs more than one in a light one.
• NAT, MSQ and MCQ miss counts. Each type needs a different drill.
• GA questions you guessed rather than knew.
• For each weak subject, open its topic page and solve the same concept from two other years.

How 2024 sits next to other years

Against GATE CS 2023: more marks in Algorithms +4, Databases (DBMS) +3, Engineering Mathematics +2; fewer in Discrete Mathematics -6, Digital Logic -2, Programming & Data Structures -2. Against GATE CS 2025: more marks in Computer Networks +3, Algorithms +2, Compiler Design +2; fewer in Programming & Data Structures -3, Discrete Mathematics -2, Digital Logic -2. The year-by-year subject table shows every year side by side.

Looking for another shift, set or language? Check the official archive.

How to sit GATE CS 2024

1. Grab your paper code PDF (and key when available) from the official GATE links.
2. Three hours, one sitting, GA + Engg Maths (if applicable) + core. Re-key NAT answers before checking the key.
3. When the clock ends, stop. Review should take at least as long as the attempt.
4. Fill the error log the same day: section, topic, and miss type (concept, silly, time, or misread).
5. Next session, repair only logged items. Then pick another year from the decade list.

Full question paper text (CS1)

Official master-paper text from IISc GATE 2024. Use the PDF for figures and crisp math.

General Aptitude (GA)

Q.1 – Q.5 Carry ONE mark Each

Q.1 If ‘→’ 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 appropriate to fill the blank?

(A) starve (B) reject (C) feast (D) deny

Q.2 If two distinct non-zero real variables and are such that ( + ) is proportional to ( − ) then the value of

(A) depends on (B) depends only on and not on (C) depends only on and not on (D) is a constant

Q.3 Consider the following sample of numbers:

9, 18, 11, 14, 15, 17, 10, 69, 11, 13

The median of the sample is

(A) 13.5 (B) 14 (C) 11 (D) 18.7

Q.4 The 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

(A) 21%

(B) 14 
2 
7% 

(C) 10% (D) 30%

Q.5 For positive non-zero real variables and , if log ( 2 + 2) = log + log + 2 log 3 ,

then, the value of

4+ 4 
2 2 is 
(A) 79 

(B) 81 (C) 9 (D) 83

Q.6 – Q.10 Carry TWO marks Each

| Q.6 | | In the given text, the blanks are numbered | | | | | | | | (i)−(iv). Select the best match for all the | | |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| | | blanks. | | | | | | | | | | |
| | | | | | | | | | (i) | | | (ii) |
| | | Steve was advised to keep his head | | | | | | | | before heading | | to bat; |
| | | | | | | | | (iii) | | | | |
| | | for, | | while he had a head | | | | | batting, he could only do so with a cool head | | | |
| | | | | (iv) | | | | | | | | |
| | | s | | | his shoulders. | | | | | | | |
| (A) | | | (i) down | | (ii) | down | | (iii) | on | (iv) | for | |
| (B) | | | (i) on | | (ii) | down | | (iii) | for | (iv) | on | |
| (C) | | | (i) down | | (ii) | out | | (iii) | for | (iv) | on | |
| (D) | | | (i) on | | (ii) | out | | (iii) | on | (iv) | for | |

Q.7 A 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 area is equal to the area of the sheet is also taken.

Then, the ratio of the volume of the cylindrical tube to the volume of the cube is

(A) 1/π (B) 2/π (C) 3/π (D) 4/π

Q.8 The 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 macronutrients is given in the table.

Macronutrient Energy density (kcal/g) 
Carbohydrates 4 
Proteins 4 
Unsaturated fat 9 
Saturated fat 9 
Trans fat 9 

The total fat (all three types), in grams, this person consumes is

(A) 44.4 (B) 77.8 (C) 100 (D) 3,600

Carbohydrates 35%

Proteins 20%

Unsaturated fat 20%

Saturated fat 20%

Trans fat 5%

Macronutrient energy contribution

Q.9 A 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 folded sheet (in cm) is

(A) 18 (B) 24 (C) 20 (D) 21

Q.10 The least number of squares to be added in the figure to make AB a line of symmetry is

(A) 6 (B) 4 (C) 5 (D) 7

Q.11 – Q.35 Carry ONE mark Each

Q.11 Let : ℝ → ℝ be a function such that ( ) = max{ , 3}, ∈ ℝ , where ℝ is the set of all real numbers. The set of all points where ( ) is NOT differentiable is

(A) {−1, 1, 2} (B) {−2, −1, 1} (C) {0, 1} (D) {−1, 0, 1}

Q.12 The product of all eigenvalues of the matrix [

1 2 3 
4 5 6 
7 8 9] is 
(A) −1 

(B) 0 (C) 1 (D) 2

Q.13 Consider a system that uses 5 bitsfor representing signed integers in 2’s complement format. In this system, two integers and are represented as =01010 and =11010. Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow?

(A) + (B) − (C) − (D) 2 ∗

Q.14 Consider a permutation sampled uniformly at random from the set of all permutations of {1, 2, 3, ⋯ , } for some ≥ 4. Let be the event that 1 occurs before 2 in the permutation, and the event that 3 occurs before 4. Which one of the following statements is TRUE?

| (A) | | The events | and | are mutually exclusive | |
| --- | --- | --- | --- | --- | --- |
| (B) | | The events | and | are independent | |
| (C) | | Either event | or | must occur | |
| (D) | | Event is more likely than event | | | |

Q.15 Which one of the following statements is FALSE?

(A)

In the cycle stealing mode of DMA, one word of data is transferred between an I/O device and main memory in a stolen cycle

(B)

For bulk data transfer, the burst mode of DMA has a higher throughput than the cycle stealing mode

(C)

Programmed I/O mechanism has a better CPU utilization than the interrupt driven I/O mechanism

(D)

The CPU can start executing an interrupt service routine faster with vectored interrupts than with non-vectored interrupts

Q.16 A 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 of a top-level index page with multiple embedded image objects. Assume that all caches (e.g., DNS cache, browser cache) are all initially empty. The following packets leave the user’s computer in some order.

(i) HTTP GET request for the index page 
(ii) DNS request to resolve the web server’s name to its IP address 
(iii) HTTP GET request for an image object 
(iv) TCP SYN to open a connection to the web server 

Which one of the following is the CORRECT chronological order (earliest in time to latest) of the packets leaving the computer ?

| (A) | | (iv), (ii), (iii), (i) | | | | | |
| --- | --- | --- | --- | --- | --- | --- | --- |
| (B) | | (ii), (iv), (iii), (i) | | | | | |
| (C) | | (ii), (iv), (i), (iii) | | | | | |
| (D) | | (iv), (ii), (i), (iii) | | | | | |
| Q.17 | | Given 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 pass through the array and comparing each | | | | element of the array only with its | |

adjacent elements. The worst-case time complexity of this algorithm is

(A) both Ο( ) and Ω( )

(B) Ο( ) but not Ω( )

(C) Ω( ) but not Ο( )

(D) neither Ο( ) nor Ω( )

Q.18 Consider the following C program:

#include <stdio.h> int main(){ int a = 6;

int b = 0;

while(a < 10) { a = a / 12 + 1;

a += b;}

printf(”%d”, a);

return 0;}

Which one of the following statements is CORRECT?

(A) The program prints 9 as output (B) The program prints 10 as output (C) The program gets stuck in an infinite loop (D) The program prints 6 as output

Q.19 Consider the following C program:

#include <stdio.h> void fX();

int main(){

fX();

return 0;} void fX(){ char a;

if((a=getchar()) != ’\n’)

fX();

if(a != ’\n’)

putchar(a);}

Assume that the input to the program from the command line is 1234 followed by a newline character. Which one of the following statements is CORRECT?

(A) The program will not terminate (B) The program will terminate with no output (C) The program will terminate with 4321 as output (D) The program will terminate with 1234 as output

Q.20 Let S be the specification: "Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students." Which one of the following ER diagrams CORRECTLY represents S?

(A) (i)

(B) (ii)

(C) (iii)

(D) (iv)

Q.21 In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?

(A) Only the root node (B) All leaf nodes (C) All internal nodes (D) Only the leftmost leaf node

Q.22 Which of the following statements about a relation R in first normal form (1NF) is/are TRUE ?

(A) R can have a multi-attribute key (B) R cannot have a foreign key (C) R cannot have a composite attribute (D) R cannot have more than one candidate key

Q.23 Let 1, 2 be two regular languages and 3 a language which is not regular. Which of the following statements is/are always TRUE?

(A) 1 = 2 if and only if 1 ∩ 2̅̅̅ = (B) 1 ∪ 3 is not regular (C) 3̅̅̅ is not regular (D) 1̅̅̅ ∪ 2̅̅̅ is regular

Q.24 Which of the following statements about threads is/are TRUE?

(A) Threads can only be implemented in kernel space (B) Each thread has its own file descriptor table for open files (C) All the threads belonging to a process share a common stack (D) Threads belonging to a process are by default not protected from each other

Q.25 Which of the following process state transitions is/are NOT possible?

(A) Running to Ready (B) Waiting to Running (C) Ready to Waiting (D) Running to Terminated

Q.26 Which of the following is/are Bottom-Up Parser(s)?

(A) Shift-reduce Parser (B) Predictive Parser (C) LL(1) Parser (D) LR Parser

Q.27 Let and be two events in a probability space with ( ) = 0.3, ( ) = 0.5, and ( ∩ ) = 0.1. Which of the following statements is/are TRUE?

(A) The two events and are independent (B) ( ∪ ) = 0.7

(C) ( ∩ ) = 0.2, where is the complement of the event

(D)

( ∩ ) = 0.4, where and are the complements of the events and , respectively

Q.28 Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no delays. Which of the following statements about the circuit is/are CORRECT?

(A) With no propagation delays, the output is always logic Zero (B) With no propagation delays, the output is always logic One

(C)

With propagation delays, the output can have a transient logic One after transitions from logic Zero to logic One

(D)

With propagation delays, the output can have a transient logic Zero after transitions from logic One to logic Zero

Q.29 TCP client P successfully establishes a connection to TCP server Q. Let denote the sequence number in the SYN sent from P to Q. Let denote the acknowledgement number in the SYN ACK from Q to P. Which of the following statements is/are CORRECT?

| (A) | | The sequence number is chosen randomly by P | |
| --- | --- | --- | --- |
| (B) | | The sequence number is always 0 for a new connection | |
| (C) | | The acknowledgement number is equal to | |
| (D) | | The acknowledgement number is equal to | + 1 |
| Q.30 | | Consider a 5-stage pipelined processor | with Instruction Fetch (IF), Instruction |
| | | Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback (WB) | |

stages. Which of the following statements about forwarding is/are CORRECT?

In a pipelined execution, forwarding means the result from a source stage of an earlier instruction is passed on to the destination stage of a later instruction

(A)

In forwarding, data from the output of the MEM stage can be passed on to the input of the EX stage of the next instruction

(B)

(C) Forwarding cannot prevent all pipeline stalls

Forwarding does not require any extra hardware to retrieve the data from the pipeline stages

(D)

Q.31 Which 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 external network?

(A) Source IP (B) Destination IP (C) Header Checksum (D) Total Length

Q.32 Let and be non-empty finite sets such that there exist one-to-one and onto functions (i) from to and (ii) from × to ∪ . The number of possible values of | | is __________

Q.33 Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below.

| | | | Operator | Precedence | Associativity | |
| --- | --- | --- | --- | --- | --- | --- |
| | | | + | Highest | Left | |
| | | | − | High | Right | |
| | | | ∗ | Medium | Right | |
| | | | / | Low | Right | |

The value of the expression 3 + 1 + 5 ∗ 2 / 7 + 2 − 4 − 7 − 6 / 2 as per the above rules is __________

Q.34 The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is _________

Q.35 Consider the following two relations, R(A,B) and S(A,C):

10 20 10 90 
20 30 30 45 
30 40 40 80 
30 50 
50 95 

The total number of tuples obtained by evaluating the following expression

< ( ⋈ . = . )

is _________

Q.36 – Q.65 Carry TWO marks Each

Q.36

Consider a network path P-Q-R between nodes P and R via router Q. Node P sends a file of size 10 6 bytes to R via this path by splitting the file into chunks of 10 3bytes each. Node P sends these chunks one after the other without any wait time between the successive chunk transmissions. Assume that the size of extra headers added to these chunks is negligible, and that the chunk size is less than the MTU.

Each of the links P-Q and Q-R has a bandwidth of 10 6bits/sec, and negligible propagation latency. Router Q immediately transmits every packet it receives from P to R, with negligible processing and queueing delays. Router Q can simultaneously receive on link P-Q and transmit on link Q-R.

Assume P starts transmitting the chunks at time = 0. Which one of the following options gives the time (in seconds, rounded off to 3 decimal places) at which R receives all the chunks of the file?

(A) 8.000 (B) 8.008 (C) 15.992 (D) 16.000

Q.37 Consider the following syntax-directed definition (SDD).

→ { . = . + . + . + . ; } → "M" 1 { . = 5 + 1. ; } → { . = −5; } → "L" 1 { . = 5 ∗ 10 + 1. ; } → { . = −10; } → "C" 1 { . = 5 ∗ 100 + 1. ; } → { . = −5; } → "K" { . = 5; }

Given "MMLK" as the input, which one of the following options is the CORRECT value computed by the SDD (in the attribute . )?

(A) 45 (B) 50 (C) 55 (D) 65

Q.38 Consider the following grammar , with as the start symbol. The grammar has three incomplete productions denoted by (1), (2), and (3).

→ | (1) → | | (2) → (3) |

The set of terminals is { , , , , }. The FIRST and FOLLOW sets of the different non-terminals are as follows.

FIRST( ) = { , , }, FIRST( ) = { , , }, FIRST( ) = { , }

FOLLOW( ) = FOLLOW( ) = { , , $}, FOLLOW( ) = { }

Which one of the following options CORRECTLY fills in the incomplete productions?

(A) (1) → (2) → (3) → (B) (1) → (2) → (3) → (C) (1) → (2) → (3) → (D) (1) → (2) → (3) →

Q.39 Consider the following pseudo-code.

1: 1 = −1 
2: 2 = 0 
3: 3 = 0 
4: 4 = 4 ∗ 3 
5: 5 = 4 ∗ 2 
6: 6 = 5 ∗ 
7: 7 = 4 + 6 
8: 8 = [ 7] 
9: if 8 <= goto 11 
10: 1 = 8 
11: 3 = 3 + 1 
12: if 3 < goto 4 
13: 2 = 2 + 1 
14: if 2 < goto 3 
15: = 1 

Which one of the following options CORRECTLY specifies the number of basic blocks and the number of instructions in the largest basic block, respectively ?

(A) 6 and 6 (B) 6 and 7 (C) 7 and 7 (D) 7 and 6

Q.40 Consider 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 happen at any time, each statement of T1 or T2 is executed atomically without interruption.

T1 T2

a = a + 1; b = 2 * b; 
b = b + 1; a = 2 * a; 

Which one of the following options lists all the possible combinations of values of a and b after both T1 and T2 finish execution?

(A) (a = 4, b = 4); (a = 3, b = 3); (a = 4, b = 3)

(B) (a = 3, b = 4); (a = 4, b = 3); (a = 3, b = 3)

(C) (a = 4, b = 4); (a = 4, b = 3); (a = 3, b = 4)

(D) (a = 2, b = 2); (a = 2, b = 3); (a = 3, b = 4)

Q.41 An 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?

(A) 82, 90, 101 (B) 82, 11, 93 (C) 131, 11, 93 (D) 131, 111, 90

Q.42 Consider the following recurrence relation:

( ) = { √ (√ ) + for ≥ 1, 1 for = 1.

Which one of the following options is CORRECT?

(A) ( ) = Θ( log log )

(B) ( ) = Θ( log )

(C) ( ) = Θ( 2 log )

(D) ( ) = Θ( 2log log )

Q.43 Consider a binary min-heap containing 105 distinct elements. Let be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of is

(A) 53 (B) 52 (C) 27 (D) 1

Q.44 The symbol → indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?

| (A) | | ( ) ( ) , → , | ( ) implies → , |
| --- | --- | --- | --- |
| (B) | | ( ) ( ) , → , | ( ) implies , → |
| (C) | | (( ) , → and | ( ) → implies , → ) |
| (D) | | ( → and → | ) implies → |
| Q.45 | | Let be a directed graph and | a depth first search (DFS) spanning tree in that |
| | | is rooted at a vertex | . Suppose is also a breadth first search (BFS) tree in , |

Q.45 Let be a directed graph and a depth first search (DFS) spanning tree in that is rooted at a vertex . Suppose is also a breadth first search (BFS) tree in , rooted at . Which of the following statements is/are TRUE for every such graph and tree ?

(A) There are no back-edges in with respect to the tree (B) There are no cross-edges in with respect to the tree (C) There are no forward-edges in with respect to the tree (D) The only edges in are the edges in

Q.46 Consider the following read-write schedule over three transactions 1, 2, and 3, where the subscripts in the schedule indicate transaction IDs:

: 1( ); 1( ); 2( ); 3( ); 3( ); 2( ); 2( ); 2( );

Which of the following transaction schedules is/are conflict equivalent to ?

(A) 1 2 3 (B) 1 3 2 (C) 3 2 1 (D) 3 1 2

Q.47 Consider a Boolean expression given by ( , , ) = ∑(3,5,6,7).

Which of the following statements is/are CORRECT?

(A) ( , , ) = Π(0,1,2,4)

(B) ( , , ) = + + (C) ( , , ) is independent of input (D) ( , , ) is independent of input

Q.48 Consider the following C function definition.

int f(int x, int y) { for (int i=0; i<y; i++) { x=x+x+y;

} return x;

} Which of the following statements is/are TRUE about the above function?

(A) If the inputs are x=20, y=10, then the return value is greater than 2 20 (B) If the inputs are x=20, y=20, then the return value is greater than 2 20 (C) If the inputs are x=20, y=10, then the return value is less than 2 10 (D) If the inputs are x=10, y=20, then the return value is greater than 2 20

Q.49 Let be any × matrix, where > . Which of the following statements is/are TRUE about the system of linear equations = 0 ?

(A) There exist at least − linearly independent solutions to this system

(B)

There exist − linearly independent vectors such that every solution is a linear combination of these vectors

(C) There exists a non-zero solution in which at least − variables are 0 (D) There exists a solution in which at least variables are non-zero

Q.50 Consider the 5-state DFA accepting the language ( ) ⊂ (0 + 1) ∗ shown below. For any string ∈ (0 + 1) ∗ let 0( ) be the number of 0 ′ in and 1( ) be the number of 1′ in .

Which of the following statements is/are FALSE?

(A) States 2 and 4 are distinguishable in (B) States 3 and 4 are distinguishable in (C) States 2 and 5 are distinguishable in (D) Any string with 0( ) = 1( ) is in ( )

Q.51 The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let be any graph with vertices and chromatic number . Which of the following statements is/are always TRUE?

(A) contains a complete subgraph with vertices (B) contains an independent set of size at least / (C) contains at least ( − 1)/2 edges (D) contains a vertex of degree at least

Q.52 Consider the operators ◊ and □ defined by ◊ = + 2 , □ = , for positive integers. Which of the following statements is/are TRUE?

(A) Operator ◊ obeys the associative law (B) Operator □ obeys the associative law (C) Operator ◊ over the operator □ obeys the distributive law (D) Operator □ over the operator ◊ obeys the distributive law

Q.53 Consider 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 (Least Recently Used) block replacement policy. The cache memory is connected to the main memory. Which of the following statements is/are TRUE?

(A) A read miss in WBC never evicts a dirty block

(B)

A read miss in WTC never triggers a write back operation of a cache block to main memory

(C) A write hit in WBC can modify the value of the dirty bit of a cache block

(D)

A write miss in WTC always writes the victim cache block to main memory before loading the missed block to the cache

Q.54 Consider 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 is _________

Q.55 The 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 parallelized. The overhead for using an additional core is 10 ns when running on a multicore system. Assume that all cores in the multicore system run their share of the parallelized code for an equal amount of time.

The number of cores that minimize the execution time of the program is ________

Q.56 A 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 instruction cache and 8% miss rate on data cache. The miss penalty is 100 cycles. The speedup (rounded off to two decimal places) achieved with a perfect cache (i.e., with NO data or instruction cache misses) is _________

Q.57 Consider 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 successfully without any errors.

int x = 3; 
while(x > 0) { 
fork(); 
printf("hello"); 
wait(NULL); 
x--; 

}

The total number of times the printf statement is executed is _______

Q.58 Consider 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 destination IP address matches the prefix. The notation “/N” in a prefix indicates a subnet mask with the most significant N bits set to 1.

Prefix Next hop router 
10.1.1.0/24 R1 
10.1.1.128/25 R2 
10.1.1.64/26 R3 
10.1.1.192/26 R4 

This router forwards 20 packets each to 5 hosts. The IP addresses of the hosts are 10.1.1.16, 10.1.1.72, 10.1.1.132, 10.1.1.191, and 10.1.1.205 . The number of packets forwarded via the next hop router R2 is _______

| Q.59 Let | = ( , Σ, | ) be a context-free grammar in Chomsky Normal Form with , | | | |
| --- | --- | --- | --- | --- | --- |
| Σ = | } { , , | and containing | 10 variable | symbols including | the start |
| symbol | . The string | 30 30 = | 30 is derivable from | . The number of steps | |

(application of rules) in the derivation → ∗ is _________

Q.60 The number of edges present in the forest generated by the DFS traversal of an undirected graph with 100 vertices is 40. The number of connected components in is _________

Q.61 Consider the following two regular expressions over the alphabet {0,1}: = 0 ∗ + 1 ∗

= 01 ∗ + 10 ∗

The total number of strings of length less than or equal to 5, which are neither in nor in , is _________

Q.62 Consider 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 are stored in the page frames 1, 3, 2, and 0, respectively. The physical address (in decimal format) corresponding to the virtual address 2500 (in decimal format) is _________

Q.63 A 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 3 decimal places) that both balls drawn are red is _________

Q.64 Consider 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 C are select lines of M1, M2, and M3, respectively.

M1

M2

M3

A

B

C

1

0

1

0

1

0

X2

X1

X4

X3

Y

Q1

Q2

S1

S2

S3

For an instance of inputs X1=1, X2=1, X3=0, and X4=0, the number of combinations of A, B, C that give the output Y=1 is _________

Q.65 Consider 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 first link (sender to router) has an MTU (Maximum Transmission Unit)

size of 542 bytes, while the second link (router to receiver) has an MTU size of 360 bytes. The number of fragments that would be delivered at the receiver is ________

Plain text copy: /papers/gate-cs-2024-cs1.txt

Other years in this decade

• GATE CS 2026
• GATE CS 2025
• GATE CS 2023
• GATE CS 2022
• GATE CS 2021
• GATE CS 2020
• GATE CS 2019
• GATE CS 2018
• GATE CS 2017
• GATE CS 2016

FAQ

Where can I download the official GATE CS 2024 question paper?

Download it from this page: the official PDF is here, with a link to the conducting body’s original.

What does the GATE CS 2024 paper analysis include?

A year snapshot, what the paper stresses, what to extract into your error log, and how 2024 compares with neighbouring years on this hub.

How should I practise the GATE CS 2024 previous year paper?

Open the official PDF, sit it timed under current brochure rules, fill an error log the same day, read the paper analysis, then move to another year in the decade list.

Is GATE CS 2024 still useful if I finished newer papers?

Yes. Recent years sharpen timing; stack them after a same-day review of each attempt.

Are memory-based GATE CS 2024 papers reliable?

Treat memory-based sets as interim. Reconcile contested items with official keys or response sheets when the conducting body publishes them.

Where is the GATE CS syllabus and pattern for this paper?

See the GATE CS syllabus & pattern page on this hub, and always re-check the latest official brochure before exam day.