E ExamMaster

← Back to GATE Computer Science papers

GATE Computer Science

GATE 2024 Computer Science and Information Technology CS-1 (Forenoon) (English)

GATE Computer Science Previous Year Question Papers — GATE 2024 Computer Science and Information Technology CS-1 (Forenoon) (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
Cs1
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 13

Consider a system that uses 5 bits for representing signed integers in 2’s complement format. In this system, two integers A and B are represented as A=01010 and B=11010. Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow?

  1. A+ B
  2. A−B
  3. B−A
  4. 2 ∗B
Official answer and source attribution

Answer: A−B

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

Question 15

Which one of the following statements is FALSE?

  1. In the cycle stealing mode of DMA, one word of data is transferred between an I/O device and main memory in a stolen cycle
  2. For bulk data transfer, the burst mode of DMA has a higher throughput than the cycle stealing mode
  3. Programmed I/O mechanism has a better CPU utilization than the interrupt driven I/O mechanism
  4. The CPU can start executing an interrupt service routine faster with vectored interrupts than with non-vectored interrupts
Official answer and source attribution

Answer: Programmed I/O mechanism has a better CPU utilization than the interrupt driven I/O mechanism

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

Question 16

A user starts browsing a webpage hosted at a remote server. The browser opens a single TCP connection to fetch the entire webpage from the server. The webpage consists of a top-level index page with multiple embedded image objects. Assume that all caches (e.g., DNS cache, browser cache) are all initially empty. The following packets leave the user’s computer in some order. (i) HTTP GET request for the index page (ii) DNS request to resolve the web server’s name to its IP address (iii) HTTP GET request for an image object (iv) TCP SYN to open a connection to the web server Which one of the following is the CORRECT chronological order (earliest in time to latest) of the packets leaving the computer ?

  1. (iv), (ii), (iii), (i)
  2. (ii), (iv), (iii), (i)
  3. (ii), (iv), (i), (iii)
  4. (iv), (ii), (i), (iii)
Official answer and source attribution

Answer: (ii), (iv), (i), (iii)

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

Question 21

In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?

  1. Only the root node
  2. All leaf nodes
  3. All internal nodes
  4. Only the leftmost leaf node
Official answer and source attribution

Answer: Only the root node

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

Question 36

Consider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size 106 bytes to R via this path by splitting the file into chunks of 103 bytes each. Node P sends these chunks one after the other without any wait time between the successive chunk transmissions. Assume that the size of extra headers added to these chunks is negligible, and that the chunk size is less than the MTU. Each of the links P—Q and Q—R has a bandwidth of 106 bits/sec, and negligible propagation latency. Router Q immediately transmits every packet it receives from P to R, with negligible processing and queueing delays. Router Q can simultaneously receive on link P—Q and transmit on link Q—R. Assume P starts transmitting the chunks at time t = 0. Which one of the following options gives the time (in seconds, rounded off to 3 decimal places) at which R receives all the chunks of the file?

  1. 8.000
  2. 8.008
  3. 15.992
  4. 16.000
Official answer and source attribution

Answer: 8.008

Official answer: option B. Source: GATE 2024 CS-1, Q.36 (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 41

An array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the following options represents the first three elements in the heapified array?

  1. 82, 90, 101
  2. 82, 11, 93
  3. 131, 11, 93
  4. 131, 111, 90
Official answer and source attribution

Answer: 131, 111, 90

Official answer: option D. Source: GATE 2024 CS-1, Q.41 (IISc Bengaluru final answer key).

Question 43

Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of k is

  1. 53
  2. 52
  3. 27
  4. 1
Official answer and source attribution

Answer: 53

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