Beginner
Operating Systems
Q36 / 100
What is the Shortest Job First (SJF) scheduling algorithm?
Correct! Well done.
Incorrect.
The correct answer is B) Schedule the process with the shortest next CPU burst, minimizing average wait time
B
Correct Answer
Schedule the process with the shortest next CPU burst, minimizing average wait time
Explanation
SJF is optimal for minimizing average wait time but requires knowing burst lengths in advance (estimated via exponential averaging for prediction). Preemptive SJF is called SRTF.
Progress
36/100