Multiple choice

Which one of the following CPU scheduling algorithms can never be preemptive?

  1. FCFS

  2. SJF scheduling

  3. Round-robin scheduling

  4. Priority based scheduling
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

This is a non-premptive scheduling algorithm. FIFO strategy assigns priority to processes in the order in which they request the processor. No other process can preempt the process until it voluntarily leaves the control of the CPU. Hence, it cannot be preemptive. So, this option is correct.

Keep practicing — related questions