Question
Which scheduling algorithm gives the minimum average waiting time when the next CPU-burst lengths are known exactly?
Select an option. Your answer will be checked instantly.
Correct Answer: B. Shortest-job-first
Explanation:
Shortest-job-first selects the process with the smallest next CPU burst and is optimal for average waiting time.
Its practical difficulty is accurately predicting future CPU-burst lengths.
Leave a Reply