Which of the following is a non-preemptive scheduling algorithm?
a) Round-Robin
b) Shortest Job Next (SJN)
c) First-Come, First-Served (FCFS)
d) Priority Scheduling
Answer:
c) First-Come, First-Served (FCFS)
Explanation:
First-Come, First-Served (FCFS) is a non-preemptive scheduling algorithm where the CPU executes processes in the order they arrive. Once a process starts executing, it runs to completion without being interrupted by other processes.
Non-preemptive algorithms allow processes to hold the CPU until they complete their tasks, which can result in longer waiting times for other processes if a long job occupies the CPU.
FCFS is simple but can lead to inefficiencies such as the convoy effect, where shorter processes are delayed by longer ones.