Multiple choice

Which of the following CPU scheduling algorithms can be preemptive as well as non-preemptive?

  1. Shortest Job First (SJF)

  2. First Come First Serve (FCFS)

  3. Round Robin

  4. Both (1) and (3)

  5. None of these
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

SJF is a non-preemptive as well as preemptive. In preemptive SJF, the process with smallest run time is run next. In non-preemptive SJF, the process with the smallest amount of time remaining until completion is selected to execute. Non-preemptive SJF is also called SRTF( Shortest Remaining Time First).

Keep practicing — related questions