Which of the following scheduling algorithms is non-preemptive?
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.