📚

GATE CS - Previous Year Questions

Actual GATE CS exam questions from previous years (2020-2025)

142 questionsâ€¢15 pagesâ€¢~213 min

Use this quiz track to strengthen recall, speed, and exam-style decision making. Attempt one page first, review explanations, and then re-attempt incorrect questions without notes.

A good scoring strategy is to mark uncertain questions, finish known ones quickly, and return with elimination logic. This improves accuracy while keeping momentum under time constraints.

Progress: 0 / 1420%

Page 3 of 15 • Questions 21-30 of 142

Q21medium

[GATE CS 2025 Set-1 Q38] A computer has two processors, 𝑀 and 𝑀 . Four processes 𝑃 ,𝑃 ,𝑃 ,𝑃 with CPU 1 2 1 2 3 4 bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and these are the only processes in the system. The scheduler uses non-preemptive priority scheduling, with priorities decided as follows: • 𝑀 uses priority of execution for the processes as, 𝑃 > 𝑃 > 𝑃 > 𝑃 , i.e., 1 1 3 2 4 𝑃 and 𝑃 have highest and lowest priorities, respectively. 1 4 • 𝑀 uses priority of execution for the processes as, 𝑃 > 𝑃 > 𝑃 > 𝑃 , i.e., 2 2 3 4 1 𝑃 and 𝑃 have highest and lowest priorities, respectively. 2 1 A process 𝑃 is scheduled to a processor 𝑀 , if the processor is free and no other 𝑖 𝑘 process 𝑃 is waiting with higher priority. At any given point of time, a process can...

A)9.00

B)8.75

C)6.50

D)7.50

Q22medium

[GATE CS 2025 Set-1 Q39] Consider two relations describing 𝑡𝑒𝑎𝑚𝑠 and 𝑝𝑙𝑎𝑦𝑒𝑟𝑠 in a sports league: • 𝑡𝑒𝑎𝑚𝑠(𝑡𝑖𝑑,𝑡𝑛𝑎𝑚𝑒): 𝑡𝑖𝑑, 𝑡𝑛𝑎𝑚e are team-id and team-name, respectively • 𝑝𝑙𝑎𝑦𝑒𝑟𝑠(𝑝𝑖𝑑,𝑝𝑛𝑎𝑚𝑒,𝑡𝑖𝑑): 𝑝𝑖𝑑, 𝑝𝑛𝑎𝑚𝑒, and 𝑡𝑖𝑑 denote player-id, player- name and the team-id of the player, respectively Which ONE of the following tuple relational calculus queries returns the name of the players who play for the team having 𝑡𝑛𝑎𝑚𝑒 as ′𝑀𝐼′?

A){ 𝑝.𝑝𝑛𝑎𝑚𝑒 | 𝑝 ∈ 𝑝𝑙𝑎𝑦𝑒𝑟𝑠∧∃𝑡 (𝑡 ∈ 𝑡𝑒𝑎𝑚𝑠∧𝑝.𝑡𝑖𝑑 = 𝑡.𝑡𝑖𝑑 ∧𝑡.𝑡𝑛𝑎𝑚𝑒 = ′𝑀𝐼′)}

B){ 𝑝.𝑝𝑛𝑎𝑚𝑒 | 𝑝 ∈ 𝑡𝑒𝑎𝑚𝑠∧∃𝑡 (𝑡 ∈ 𝑝𝑙𝑎𝑦𝑒𝑟𝑠∧𝑝.𝑡𝑖𝑑 = 𝑡.𝑡𝑖𝑑 ∧𝑡.𝑡𝑛𝑎𝑚𝑒 = ′𝑀𝐼′)}

C){ 𝑝.𝑝𝑛𝑎𝑚𝑒 | 𝑝 ∈ 𝑝𝑙𝑎𝑦𝑒𝑟𝑠∧∃𝑡 (𝑡 ∈ 𝑡𝑒𝑎𝑚𝑠∧𝑡.𝑡𝑛𝑎𝑚𝑒 = ′𝑀𝐼′)}

D){ 𝑝.𝑝𝑛𝑎𝑚𝑒 | 𝑝 ∈ 𝑡𝑒𝑎𝑚𝑠∧∃𝑡 (𝑡 ∈ 𝑝𝑙𝑎𝑦𝑒𝑟𝑠∧𝑡.𝑡𝑛𝑎𝑚𝑒 = ′𝑀𝐼′)}

Q23medium

[GATE CS 2025 Set-1 Q40] A packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?

A)E3

B)E1

C)E2

D)E5

Q24medium

[GATE CS 2025 Set-1 Q41] 1 1 𝐴 = [ ] 1 −1 W hat are the eigenvalues of the matrix 𝐴13 ?

A)1, −1

B)2√2, −2√2

C)4√2, −4√2

D)64√2, −64√2

Q25medium

[GATE CS 2025 Set-1 Q42] Consider the following four variable Boolean function in sum-of-product form 𝐹(𝑏 ,𝑏 ,𝑏 ,𝑏 ) = ∑(0,2,4,8,10,11,12). 3 2 1 0 where the value of the function is computed by considering 𝑏 𝑏 𝑏 𝑏 as a 4-bit 3 2 1 0 binary number, where 𝑏 denotes the most significant bit and 𝑏 denotes the least 3 0 significant bit. Note that there are no don’t care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for 𝐹?

A)𝑏̅ 𝑏̅ +𝑏̅ 𝑏̅ +𝑏 𝑏̅ 𝑏 1 0 2 0 1 2 3

B)𝑏̅ 𝑏̅ + 𝑏̅ 𝑏̅ 1 0 2 0

C)𝑏̅ 𝑏̅ +𝑏 𝑏 𝑏 2 0 1 2 3

D)𝑏̅ 𝑏̅ +𝑏̅ 0 2 3

Q26medium

[GATE CS 2025 Set-1 Q43] Let 𝐺(𝑉,𝐸) be an undirected and unweighted graph with 100 vertices. Let 𝑑(𝑢,𝑣) denote the number of edges in a shortest path between vertices 𝑢 and 𝑣 in 𝑉. Let the maximum value of 𝑑(𝑢,𝑣), 𝑢,𝑣 ∈ 𝑉 such that 𝑢 ≠ 𝑣, be 30. Let 𝑇 be any breadth- first-search tree of 𝐺. Which ONE of the given options is CORRECT for every such graph 𝐺?

A)The height of 𝑇 is exactly 15.

B)The height of 𝑇 is exactly 30.

C)The height of 𝑇 is at least 15.

D)The height of 𝑇 is at least 30.

Q27medium

[GATE CS 2025 Set-1 Q44] Consider the following two languages over the alphabet {𝑎,𝑏}: 𝐿 = { 𝛼𝛽𝛼 | 𝛼 ∈ {𝑎,𝑏}+ AND 𝛽 ∈ {𝑎,𝑏}+ } 1 𝐿 = { 𝛼𝛽𝛼 | 𝛼 ∈ {𝑎}+ AND 𝛽 ∈ {𝑎,𝑏}+ } 2 Which ONE of the following statements is CORRECT?

A)Both 𝐿 and 𝐿 are regular languages. 1 2

B)𝐿 is a regular language but 𝐿 is not a regular language. 1 2

C)𝐿 is not a regular language but 𝐿 is a regular language. 1 2

D)Neither 𝐿 nor 𝐿 is a regular language. 1 2

Q28medium

[GATE CS 2025 Set-1 Q45] Consider the following two languages over the alphabet {𝑎,𝑏,𝑐}, where 𝑚 and 𝑛 are natural numbers. 𝐿 = {𝑎𝑚𝑏𝑚𝑐𝑚+𝑛 | 𝑚,𝑛 ≥ 1} 1 𝐿 = {𝑎𝑚𝑏𝑛𝑐𝑚+𝑛 | 𝑚,𝑛 ≥ 1} 2 Which ONE of the following statements is CORRECT?

A)Both 𝐿 and 𝐿 are context-free languages. 1 2

B)𝐿 is a context-free language but 𝐿 is not a context-free language. 1 2

C)𝐿 is not a context-free language but 𝐿 is a context-free language. 1 2

D)Neither 𝐿 nor 𝐿 are context-free languages. 1 2

Q29medium

[GATE CS 2025 Set-1 Q46] Which of the following statement(s) is/are TRUE while computing First and Follow during top down parsing by a compiler?

A)For a production 𝐴 → 𝜖, 𝜖 will be added to 𝐹𝑖𝑟𝑠𝑡(𝐴).

B)If there is any input right end marker, it will be added to 𝐹𝑖𝑟𝑠𝑡(𝑆), where 𝑆 is the start symbol.

C)For a production 𝐴 → 𝜖, 𝜖 will be added to 𝐹𝑜𝑙𝑙𝑜𝑤(𝐴).

D)If there is any input right end marker, it will be added to 𝐹𝑜𝑙𝑙𝑜𝑤(𝑆), where 𝑆 is the start symbol.

Q30medium

[GATE CS 2025 Set-1 Q47] Consider a relational schema 𝑡𝑒𝑎𝑚(𝑛𝑎𝑚𝑒,𝑐𝑖𝑡𝑦,𝑜𝑤𝑛𝑒𝑟), with functional dependencies {𝑛𝑎𝑚𝑒 → 𝑐𝑖𝑡𝑦, 𝑛𝑎𝑚𝑒 → 𝑜𝑤𝑛𝑒𝑟}. The relation 𝑡𝑒𝑎𝑚 is decomposed into two relations, 𝑡1(𝑛𝑎𝑚𝑒,𝑐𝑖𝑡𝑦) and 𝑡2(𝑛𝑎𝑚𝑒,𝑜𝑤𝑛𝑒𝑟). Which of the following statement(s) is/are TRUE?

A)The relation 𝑡𝑒𝑎𝑚 is NOT in BCNF.

B)The relations 𝑡1 and 𝑡2 are in BCNF.

C)The decomposition constitutes a lossless join.

D)The relation 𝑡𝑒𝑎𝑚 is NOT in 3NF.

...

Quiz Pages

Navigate directly to paginated quiz sets. These links help you revise by page and make every page discoverable.

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Page 8 Page 9 Page 10 Page 11 Page 12 Page 13 Page 14 Page 15