📚

GATE CS - Previous Year Questions

Previous-year GATE CS prompts for practice — options only until official keys are verified

142 questions15 pages~213 min

Practice with previous-year prompts and options. Official answer keys are not shown here yet — mark your choice, then verify against the IIT key PDF.

Use this track for exam reading speed and elimination practice until verified keys are linked.

Progress: 0 / 1420%

Page 2 of 15 • Questions 11-20 of 142

Practice mode: questions and options only. Official IIT answer keys are not linked here yet — mark your choice, then cross-check the official key yourself.

Q11medium

[GATE CS 2025 Set-1 Q21] Consider the following 𝐵+ tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the 𝐵+ tree. Which of the following options(s) is/are CORRECT?

A)None of the nodes will split.

B)At least one node will split and redistribute.

C)The total number of nodes will remain same.

D)The height of the tree will increase.

Q12medium

[GATE CS 2025 Set-1 Q22] Consider the 3-way handshaking protocol for TCP connection establishment. Let the three packets exchanged during the connection establishment be denoted as P1, P2, and P3, in order. Which of the following option(s) is/are TRUE with respect to TCP header flags that are set in the packets?

A)P3: SYN = 1, ACK = 1

B)P2: SYN = 1, ACK = 1

C)P2: SYN = 0, ACK = 1

D)P1: SYN = 1

Q13medium

[GATE CS 2025 Set-1 Q23] real-valued constant. Which of the following option(s) is/are CORRECT? 𝑥 +𝑘𝑦 = 1 𝑘𝑥+𝑦 = −1

A)There is exactly one value of 𝑘 for which the above system of equations has no solution.

B)There exist an infinite number of values of 𝑘 for which the system of equations has no solution.

C)There exists exactly one value of 𝑘 for which the system of equations has exactly one solution.

D)There exists exactly one value of 𝑘 for which the system of equations has an infinite number of solutions.

Q14medium

[GATE CS 2025 Set-1 Q24] Let 𝑋 be a 3-variable Boolean function that produces output as ‘1’ when at least two of the input variables are ‘1’. Which of the following statement(s) is/are CORRECT, where 𝑎,𝑏,𝑐,𝑑,𝑒 are Boolean variables?

A)𝑋(𝑎,𝑏,𝑋(𝑐,𝑑,𝑒)) = 𝑋(𝑋(𝑎,𝑏,𝑐),𝑑,𝑒)

B)𝑋(𝑎,𝑏,𝑋(𝑎,𝑏,𝑐)) = 𝑋(𝑎,𝑏,𝑐)

C)𝑋(𝑎,𝑏,𝑋(𝑎,𝑐,𝑑)) = (𝑋(𝑎,𝑏,𝑎) AND 𝑋(𝑐,𝑑,𝑐))

D)𝑋(𝑎,𝑏,𝑐) = 𝑋(𝑎,𝑋(𝑎,𝑏,𝑐),𝑋(𝑎,𝑐,𝑐))

Q15medium

[GATE CS 2025 Set-1 Q25] The number −6 can be represented as 1010 in 4-bit 2’s complement representation. Which of the following is/are CORRECT 2’s complement representation(s) of −6?

A)1000 1010 in 8-bits

B)1111 1010 in 8-bits

C)1000 0000 0000 1010 in 16-bits

D)1111 1111 1111 1010 in 16-bits

Q16medium

[GATE CS 2025 Set-1 Q26] Which of the following statement(s) is/are TRUE for any binary search tree (BST) having 𝑛 distinct integers?

A)The maximum length of a path from the root node to any other node is (𝑛−1).

B)An inorder traversal will always produce a sorted sequence of elements.

C)Finding an element takes 𝑂(log 𝑛) time in the worst case. 2

D)Every BST is also a Min-Heap.

Q17medium

[GATE CS 2025 Set-1 Q27] A partial data path of a processor is given in the figure, where RA, RB, and RZ are 32-bit registers. Which option(s) is/are CORRECT related to arithmetic operations using the data path as shown?

A)The data path can implement arithmetic operations involving two registers.

B)The data path can implement arithmetic operations involving one register and one immediate value.

C)The data path can implement arithmetic operations involving two immediate values.

D)The data path can only implement arithmetic operations involving one register and one immediate value.

Q18medium

[GATE CS 2025 Set-1 Q28] A regular language 𝐿 is accepted by a non-deterministic finite automaton (NFA) with 𝑛 states. Which of the following statement(s) is/are FALSE?

A)𝐿 may have an accepting NFA with < 𝑛 states.

B)𝐿 may have an accepting DFA with < 𝑛 states.

C)There exists a DFA with ≤ 2𝑛 states that accepts 𝐿.

D)Every DFA that accepts 𝐿 has > 2𝑛 states.

Q19medium

[GATE CS 2025 Set-1 Q36] Consider a memory system with 1M bytes of main memory and 16K bytes of cache memory. Assume that the processor generates 20-bit memory address, and the cache block size is 16 bytes. If the cache uses direct mapping, how many bits will be required to store all the tag values? [Assume memory is byte addressable, 1K=210, 1M=220 .]

A)6×210

B)8×210

C)212

D)214

Q20medium

[GATE CS 2025 Set-1 Q37] A processor has 64 general-purpose registers and 50 distinct instruction types. An instruction is encoded in 32-bits. What is the maximum number of bits that can be used to store the immediate operand for the given instruction? ADD R1, #25 // R1 = R1 + 25

A)16

B)20

C)22

D)24

1 2 3...15