Three processes arrive at time zero with CPU bursts of 16, 20 and 10…
2021
Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Attempted by 212 students.
A video solution is available for this question — log in and enroll to watch it.