Which one of the following CPU scheduling algorithms cannot be preemptive?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2026 Set 2 · Q23
MCQ1 markEasy
Time
Which one of the following CPU scheduling algorithms cannot be preemptive?
Select one answerSingle correct
Pick an option to check
Solution
Step-by-step verified solution
Official answer: B) First Come First Serve (FCFS) Scheduling
CPU and I/O SchedulingA scheduling algorithm is preemptive if the operating system can interrupt a currently executing process and allocate the CPU to another process.
First Come First Serve (FCFS): FCFS allocates the CPU strictly in the order of process arrival. Once a process is allocated the CPU, it holds it until it either terminates or yields the CPU for I/O. Therefore, FCFS is strictly non-preemptive.
Shortest Remaining Time First (SRTF): This is the preemptive version of Shortest Job First (SJF) scheduling.
Round Robin (RR): Inherently preemptive based on a fixed time quantum/slice.
Priority Scheduling: Can be implemented in both preemptive and non-preemptive modes.
Therefore, (B) is the correct option.
Try the question first, then check your work.
Examiner trap
The misconception this question tests
Identify the simplest scheduling algorithm that executes processes entirely to completion or I/O block in the strict order of their arrival.
This CPU and I/O Scheduling previous year question is Q23 of the GATE CSE 2026 Set 2 paper. Find more GATE CSE PYQs on CPU and I/O Scheduling in Operating Systems, or browse all GATE CSE PYQs.
Free diagnostic
Where do you stand for GATE?
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related CPU and I/O Scheduling PYQs now with no account.
One GATE CSE PYQ every morning
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
CPU and I/O Scheduling in GATE CSE
CPU and I/O Scheduling has 25 GATE CSE PYQs across 22 papers from 2011 to 2026. 4 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2026 Set 2.
How GATE tests CPU and I/O SchedulingMore from GATE CSE 2026 Set 2
- Q25Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity (n)?MSQ1 markEasy
- Q21Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500…MCQ1 markMedium
- Q26Let R be a binary relation on the set {1, 2, , 10}, where (x, y) ∈ R if the product of x and y is square of an integer. Which of the following properties is/ar…MSQ1 markMedium
- Q20Consider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A. For these two transactions to not conflict on A, w…MCQ1 markEasy
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.