📚

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 14 of 15 • Questions 131-140 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.

Q131medium

[GATE CS 2024 Set-2 Q29] Which of the following statements is/are FALSE? An attribute grammar is a syntax-directed definition (SDD) in which the functions

A)in the semantic rules have no side effects The attributes in a L-attributed definition cannot always be evaluated in a depth-

B)first order

C)Synthesized attributes can be evaluated by a bottom-up parser as the input is parsed All L-attributed definitions based on LR(1) grammar can be evaluated using a

D)bottom-up parsing strategy

Q132medium

[GATE CS 2024 Set-2 Q30] For a Boolean variable 𝑥, which of the following statements is/are FALSE?

A)𝑥.1 = 𝑥

B)𝑥+1 = 𝑥

C)𝑥.𝑥 = 0

D)𝑥+𝑥̅ = 1 Page 20 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q133medium

[GATE CS 2024 Set-2 Q31] An instruction format has the following structure: Instruction Number: Opcode destination reg, source reg-1, source reg-2 Consider the following sequence of instructions to be executed in a pipelined processor: I1: DIV R3, R1, R2 I2: SUB R5, R3, R4 I3: ADD R3, R5, R6 I4: MUL R7, R3, R8 Which of the following statements is/are TRUE?

A)There is a RAW dependency on R3 between I1 and I2

B)There is a WAR dependency on R3 between I1 and I3

C)There is a RAW dependency on R3 between I2 and I3

D)There is a WAW dependency on R3 between I3 and I4 Page 21 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q134medium

[GATE CS 2024 Set-2 Q32] Which of the following fields of an IP header is/are always modified by any router before it forwards the IP packet?

A)Source IP Address

B)Protocol

C)Time to Live (TTL)

D)Header Checksum

Q135medium

[GATE CS 2024 Set-2 Q33] Consider the following C function definition. int fX(char a){ char b = a; while(*b) b++; return b - a;} Which of the following statements is/are TRUE?

A)The function call fX(”abcd”) will always return a value Assuming a character array c is declared as char c[] = ”abcd” in main(),

B)the function call fX(c)will always return a value

C)The code of the function will not compile

D)Assuming a character pointer c is declared as char *c = ”abcd” in main(), the function call fX(c)will always return a value Page 22 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q136medium

[GATE CS 2024 Set-2 Q36] What is the output of the following C program? #include <stdio.h> int main() { double a[2]={20.0, 25.0}, p, q; p = a; q = p + 1; printf(”%d,%d”, (int)(q – p), (int)(q – p)); return 0;}

A)4,8

B)1,5

C)8,5

D)1,8 Page 24 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q137medium

[GATE CS 2024 Set-2 Q37] Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time, and the second value is its CPU burst time. A (0, 10), B (2, 6), C (4, 3), and D (6, 7). Which one of the following options gives the average waiting times when preemptive Shortest Remaining Time First (SRTF) and Non-Preemptive Shortest Job First (NP-SJF) CPU scheduling algorithms are applied to the processes?

A)SRTF = 6, NP-SJF = 7

B)SRTF = 6, NP-SJF = 7.5

C)SRTF = 7, NP-SJF = 7.5

D)SRTF = 7, NP-SJF = 8.5 Which one of the following CIDR prefixes exactly represents the range of

Q138medium

[GATE CS 2024 Set-2 Q38] IP addresses 10.12.2.0 to 10.12.3.255?

A)10.12.2.0/23

B)10.12.2.0/24

C)10.12.0.0/22

D)10.12.2.0/22 Page 25 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q139medium

[GATE CS 2024 Set-2 Q39] You are given a set 𝑉 of distinct integers. A binary search tree 𝑇 is created by inserting all elements of 𝑉 one by one, starting with an empty tree. The tree 𝑇 follows the convention that, at each node, all values stored in the left subtree of the node are smaller than the value stored at the node. You are not aware of the sequence in which these values were inserted into 𝑇, and you do not have access to 𝑇. Which one of the following statements is TRUE?

A)Inorder traversal of 𝑇 can be determined from 𝑉

B)Root node of 𝑇 can be determined from 𝑉

C)Preorder traversal of 𝑇 can be determined from 𝑉

D)Postorder traversal of 𝑇 can be determined from 𝑉 Page 26 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q140medium

[GATE CS 2024 Set-2 Q40] Consider the following context-free grammar where the start symbol is 𝑆 and the set of terminals is {𝑎,𝑏,𝑐,𝑑}. 𝑆 → 𝐴𝑎𝐴𝑏⁡|⁡𝐵𝑏𝐵𝑎 𝐴 → 𝑐𝑆⁡|⁡𝜖 𝐵 → 𝑑𝑆⁡|⁡𝜖 The following is a partially-filled LL(1) parsing table. 𝑎 𝑏 𝑐 𝑑 $ 𝑆 𝑆 → 𝐴𝑎𝐴𝑏 𝑆 → 𝐵𝑏𝐵𝑎 (1) (2) 𝐴 𝐴 → 𝜖 (3) 𝐴 → 𝑐𝑆 𝐵 (4) 𝐵 → 𝜖 𝐵 → 𝑑𝑆 Which one of the following options represents the CORRECT combination for the numbered cells in the parsing table? Note: In the options, “blank” denotes that the corresponding cell is empty. (1) 𝑆 → 𝐴𝑎𝐴𝑏 (2) 𝑆 → 𝐵𝑏𝐵𝑎 (3) 𝐴 → 𝜖 (4) 𝐵 → 𝜖

A)(1) 𝑆 → 𝐵𝑏𝐵𝑎 (2) 𝑆 → 𝐴𝑎𝐴𝑏 (3) 𝐴 → 𝜖 (4) 𝐵 → 𝜖

B)(1) 𝑆 → 𝐴𝑎𝐴𝑏 (2) 𝑆 → 𝐵𝑏𝐵𝑎 (3) blank (4) blank

C)(1) 𝑆 → 𝐵𝑏𝐵𝑎 (2) 𝑆 → 𝐴𝑎𝐴𝑏 (3) blank (4) blank

D)Page 27 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

1...13 14 15