GATE CS 2026 Set 2 Q.23: CPU Scheduling

Which one of the following CPU scheduling algorithms cannot be preemptive?

Shortest Remaining Time First (SRTF) Scheduling

First Come First Serve (FCFS) Scheduling

Round Robin Scheduling

Priority Scheduling

Official answer and solution

Official answer: B
From: Official GATE 2026 answer key

Solution

Check which scheduling discipline is strictly non-preemptive by definition.

First Come First Serve (FCFS) schedules processes strictly in the order of their arrival and runs each scheduled process to completion (or until it blocks for I/O); it is inherently non-preemptive. SRTF and Round Robin are preemptive by definition, and Priority Scheduling can be either preemptive or non-preemptive.

Final answer

Option (B)

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper: GATE 2026 Computer Science and Information Technology - Session 2 (CS2)
Question: 23 of 65
Section: Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.

Question

Solution

Source