Which one of the following CPU scheduling algorithms cannot be preemptive?
2026
Which one of the following CPU scheduling algorithms cannot be preemptive?
- A.
Shortest Remaining Time First (SRTF) Scheduling
- B.
First Come First Serve (FCFS) Scheduling
- C.
Round Robin Scheduling
- D.
Priority Scheduling
Attempted by 279 students.
Show answer & explanation
Correct answer: B
First Come First Serve (FCFS) is inherently non-preemptive because once a process begins execution, it runs to completion. Other algorithms like Round Robin allow interruption based on time slices or priority changes.