📚

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 12 of 15 • Questions 111-120 of 142

Q111medium

[GATE CS 2024 Set-1 Q52] 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 Page 32 of 36 Organizing Institute: IISc Bengaluru Computer Science and Information Technology Set 1 (CS1)

Q112medium

[GATE CS 2024 Set-1 Q53] 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 A read miss in WTC never triggers a write back operation of a cache block to

B)main memory

C)A write hit in WBC can modify the value of the dirty bit of a cache block A write miss in WTC always writes the victim cache block to main memory

D)before loading the missed block to the cache

Q113medium

[GATE CS 2024 Set-2 Q11] intervals. Which one of the following is the data transfer rate (in bits per second) of the DMA controller if 1% of the processor cycles are used for DMA?

A)2,56,000

B)3,200

C)25,60,000

D)32,000

Q114medium

[GATE CS 2024 Set-2 Q12] Let 𝑝 and 𝑞⁡be the following propositions: 𝑝: Fail grade can be given. 𝑞: Student scores more than 50% marks. Consider the statement: “Fail grade cannot be given when student scores more than 50% marks.” Which one of the following is the CORRECT representation of the above statement in propositional logic?

A)𝑞 → ¬⁡𝑝

B)𝑞 → 𝑝

C)𝑝 → 𝑞

D)¬⁡𝑝 → 𝑞 Page 9 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q115medium

[GATE CS 2024 Set-2 Q13] Consider the following C program. Assume parameters to a function are evaluated from right to left. #include <stdio.h> int g(int p) { printf("%d", p); return p; } int h(int q) { printf("%d", q); return q; } void f(int x, int y) { g(x); h(y); } int main() { f(g(10),h(20)); } Which one of the following options is the CORRECT output of the above C program?

A)20101020

B)10202010

C)20102010

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

Q116medium

[GATE CS 2024 Set-2 Q14] The format of a single-precision floating-point number as per the IEEE 754 standard is: Sign Exponent Mantissa (1bit) (8 bits) (23 bits) Choose the largest floating-point number among the following options. Sign Exponent Mantissa 0 0111 1111 1111 1111 1111 1111 1111 111

A)Sign Exponent Mantissa 0 1111 1110 1111 1111 1111 1111 1111 111

B)Sign Exponent Mantissa 0 1111 1111 1111 1111 1111 1111 1111 111

C)Sign Exponent Mantissa

D)0 0111 1111 0000 0000 0000 0000 0000 000 Page 11 of 40 Organizing Institute: IISc, Bengaluru Computer Science and Information Technology Set 2 (CS2)

Q117medium

[GATE CS 2024 Set-2 Q15] Let 𝑇(𝑛) be the recurrence relation defined as follows: 𝑇(0) = 1, 𝑇(1) = 2, and 𝑇(𝑛) = 5𝑇(𝑛−1)−6𝑇(𝑛−2) for 𝑛 ≥ 2 Which one of the following statements is TRUE?

A)𝑇(𝑛) = ⁡Θ(2𝑛)⁡

B)𝑇(𝑛) = ⁡Θ(𝑛2𝑛)

C)𝑇(𝑛) = ⁡Θ(3𝑛)

D)𝑇(𝑛) = ⁡Θ(𝑛3𝑛)

Q118medium

[GATE CS 2024 Set-2 Q16] Let 𝑓(𝑥) be a continuous function from ℝ to ℝ such that 𝑓(𝑥) = 1−𝑓(2−𝑥) 2 Which one of the following options is the CORRECT value of ∫ 𝑓(𝑥)𝑑𝑥 ? 0

A)0

B)1

C)2

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

Q119medium

[GATE CS 2024 Set-2 Q17] Let 𝐴 be the adjacency matrix of a simple undirected graph 𝐺. Suppose 𝐴 is its own inverse. Which one of the following statements is always TRUE?

A)𝐺 is a cycle

B)𝐺 is a perfect matching

C)𝐺 is a complete graph

D)There is no such graph 𝐺

Q120medium

[GATE CS 2024 Set-2 Q18] When six unbiased dice are rolled simultaneously, the probability of getting all distinct numbers (i.e., 1, 2, 3, 4, 5, and 6) is 1

A)324 5

B)324 7

C)324 11

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

......

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