The ___________ scheduling algorithm selects the process with the shortest burst time.

  • First Come First Serve
  • Priority
  • Round Robin
  • Shortest Job First
Shortest Job First (SJF) scheduling algorithm selects the process with the shortest burst time to execute next. This minimizes the average waiting time and improves system throughput by prioritizing smaller jobs. SJF can be either preemptive or non-preemptive, where in preemptive SJF, a new job with a shorter burst time can interrupt the currently running job.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *