 Solution

ID: 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

Shortest-seek-time-first disk scheduling chooses the nearest remaining track after each service:

133 -> 135 -> 142 -> 157 -> 112 -> 97 -> 91 -> 76 -> 23

2, 7, 15, 45, 15, 6, 15, 53

, giving 158 tracks. There are no distance ties along this service sequence.

 New to topics? Read the docs here!