Question
Which disk-scheduling algorithm selects the pending request closest to the current head position?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Shortest-seek-time-first
Explanation:
SSTF attempts to reduce immediate seek distance by choosing the nearest request.
Requests far from a frequently busy region can suffer starvation.
Leave a Reply