Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof (resit) / 3 / b / ii / Solution 2026-10-31
View more
Shortest-seek-time-first disk scheduling chooses the nearest remaining track after each service:
133 -> 135 -> 142 -> 157 -> 112 -> 97 -> 91 -> 76 -> 23
The distances are , giving 158 tracks. There are no distance ties along this service sequence.
Read the full article