Multiple choice

Which of the following scheduling algorithms is non-preemptive?

  1. Round Robin

  2. First-In First-Out

  3. Multilevel Queue Scheduling

  4. Multilevel Queue Scheduling with Feedback
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Round robin is preemptive since processes are cycled for CPU time, & run for a particular time stamp in one cycle. Multilevel queue scheduling maintains various quenes, each having different priorities. But in FIFO scheme, only the process which enters once, would be completed first, so no. preemption.

Keep practicing — related questions