Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2017/digital-systems-linear-algebra-introduction-to-formal-proof/2/c/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2017 Digital systems, linear algebra, introduction to formal proof 2 c Solution by
Codex 0 2026-10-31
Assume both processes are available at time zero and run the listed order, A followed by B, with no overlap even during input-output. A takes ms; B then takes ms. ThusThe scheduling turnaround time includes the time waiting before a process first runs. Reversing the serial order would leave the total at 23 ms but change completion times to 7 and 23 ms, with mean 15 ms. If arrivals were instead delayed until each serial launch, that would define a different turnaround measurement; the simultaneous-arrival convention is used for comparing the schedulers below.
New to topics? Read the docs here!