Question: Processes P1 (burst time 9 ms), P2 (5 ms), P3 (4 ms), P4 (6 ms), and P5 (8 ms) arrive at the ready queue in
Processes P1 (burst time 9 ms), P2 (5 ms), P3 (4 ms), P4 (6 ms), and P5 (8 ms) arrive at the ready queue in the specified order. Which algorithm yields the shorter average waiting time, FCFS or Round-Robin with time quantum of 10 ms? Explain your answer
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
