Which CPU scheduling algorithm selects the ready process with the smallest next CPU burst and, in its non-preemptive form, runs it until completion or blocking?

Options

  • A. First Come First Served (FCFS)
  • B. Shortest Job First (SJF)
  • C. Round Robin (RR)
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. Shortest Job First (SJF)

Detailed Explanation

Explanation: Non-preemptive Shortest Job First selects the ready process with the smallest CPU burst. It can minimize average waiting time when burst times are known, but long jobs may suffer starvation.