Question 97

Computer Awareness I/O Management and CPU Scheduling Medium

Which of the following scheduling algorithms is non-preemptive?

(A) Round Robin
(B) First-Come-First-Serve (FCFS)
(C) Shortest Remaining Time First (SRTF)
(D) Priority Scheduling with Preemption
View Dynamic Solution & Explanation
Correct Solution: Option B

Step-by-step Solution:

In non-preemptive scheduling, once the CPU has been allocated to a process, the process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. First-Come-First-Serve (FCFS) is a non-preemptive scheduling algorithm.