The GATE Grind

GATE 2026 CS (CS2) – Question 23

Operating System · CPU and I/O Scheduling · 1 mark · Multiple choice

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

  1. Shortest Remaining Time First (SRTF)
  2. First Come First Serve (FCFS)
  3. Round Robin
  4. Priority scheduling

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) First Come First Serve (FCFS)

Explanation

FCFS schedules processes strictly in order of arrival and, by definition, does not preempt a running process. The other policies can be implemented in preemptive form. Therefore, option (B) is correct.