E ExamMaster

← Back to GATE Computer Science papers

GATE Computer Science

GATE 2024 Computer Science and Information Technology CS-2 (Afternoon) (English)

GATE Computer Science Previous Year Question Papers — GATE 2024 Computer Science and Information Technology CS-2 (Afternoon) (English). Official GATE Computer Science question-paper PDFs: 2024-2026 from the live organising-institute sites, and 2007-2023 from Internet Archive captures of the IIT Kanpur, IIT Kharagpur, IISc and IIT Guwahati GATE archives that once republished every earlier paper, with the official answer key wherever the same host captured one. Reviewed questions and answers are published for 2024-2025; the remaining years are PDF-only.

Paper details

Year
2024
Shift
Cs2
Language
English

Validated source link: GATE (rotating organising institute) (retrieved 2026-08-23).

Official question paper PDF

Open official question paper PDF

Your browser cannot display the PDF inline. Use the validated source link: Open official question paper PDF.

Sign up free to view the full paper

The full PDF, reviewed answers where available, and the whole archive in the ExamMaster app.

Continue to the official source →

Question 11

Consider a computer with a 4 MHz processor. Its DMA controller can transfer 8 bytes in 1 cycle from a device to main memory through cycle stealing at regular 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?

  1. 2,56,000
  2. 3,200
  3. 25,60,000
  4. 32,000
Official answer and source attribution

Answer: 25,60,000

Official answer: option C. Source: GATE 2024 CS-2, Q.11 (IISc Bengaluru final answer key).

Question 17

Let A be the adjacency matrix of a simple undirected graph G. Suppose A is its own inverse. Which one of the following statements is always TRUE?

  1. G is a cycle
  2. G is a perfect matching
  3. G is a complete graph
  4. There is no such graph G
Official answer and source attribution

Answer: G is a perfect matching

Official answer: option B. Source: GATE 2024 CS-2, Q.17 (IISc Bengaluru final answer key).

Question 19

Once the DBMS informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called

  1. durability
  2. atomicity
  3. consistency
  4. isolation
Official answer and source attribution

Answer: durability

Official answer: option A. Source: GATE 2024 CS-2, Q.19 (IISc Bengaluru final answer key).

Question 20

In the context of owner and weak entity sets in the ER (Entity-Relationship) data model, which one of the following statements is TRUE?

  1. The weak entity set MUST have total participation in the identifying relationship
  2. The owner entity set MUST have total participation in the identifying relationship
  3. Both weak and owner entity sets MUST have total participation in the identifying relationship
  4. Neither weak entity set nor owner entity set MUST have total participation in the identifying relationship
Official answer and source attribution

Answer: The weak entity set MUST have total participation in the identifying relationship

Official answer: option A. Source: GATE 2024 CS-2, Q.20 (IISc Bengaluru final answer key).

Question 37

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?

  1. SRTF = 6, NP-SJF = 7
  2. SRTF = 6, NP-SJF = 7.5
  3. SRTF = 7, NP-SJF = 7.5
  4. SRTF = 7, NP-SJF = 8.5
Official answer and source attribution

Answer: SRTF = 6, NP-SJF = 7.5

Official answer: option B. Source: GATE 2024 CS-2, Q.37 (IISc Bengaluru final answer key).

Keep studying with ExamMaster

Create a free account to save your place and continue studying. Every question in this paper stays available.

Question 38

Which one of the following CIDR prefixes exactly represents the range of IP addresses 10.12.2.0 to 10.12.3.255?

  1. 10.12.2.0/23
  2. 10.12.2.0/24
  3. 10.12.0.0/22
  4. 10.12.2.0/22
Official answer and source attribution

Answer: 10.12.2.0/23

Official answer: option A. Source: GATE 2024 CS-2, Q.38 (IISc Bengaluru final answer key).

Question 39

You are given a set V of distinct integers. A binary search tree T is created by inserting all elements of V one by one, starting with an empty tree. The tree T 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 T, and you do not have access to T. Which one of the following statements is TRUE?

  1. Inorder traversal of T can be determined from V
  2. Root node of T can be determined from V
  3. Preorder traversal of T can be determined from V
  4. Postorder traversal of T can be determined from V
Official answer and source attribution

Answer: Inorder traversal of T can be determined from V

Official answer: option A. Source: GATE 2024 CS-2, Q.39 (IISc Bengaluru final answer key).

Question 45

The relation schema, Person(pid,city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators are available: selection, projection, cross product, and rename. To find the list of cities where at least 3 persons reside, using the above operators, the minimum number of cross product operations that must be used is

  1. 1
  2. 2
  3. 3
  4. 4
Official answer and source attribution

Answer: 2

Official answer: option B. Source: GATE 2024 CS-2, Q.45 (IISc Bengaluru final answer key).