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/i/solution

First-come-first-served disk scheduling follows the arrival order:
133 -> 76 -> 157 -> 91 -> 142 -> 97 -> 135 -> 112 -> 23
The total seek distance is
The initial position is 133; the earlier completed request at 135 is used to determine direction for the elevator policy, not added again to this total.

New to topics? Read the docs here!