Consider the following set of processes and the length of CPU burst time given in milliseconds :
$\begin{array}{|c|c|} \hline \text{Process} & \text{CPU Burst time (ms)} \\ \hline P_1 & 5 \\ \hline P_2 & 7 \\ \hline P_3 & 6 \\ \hline P_4 & 4 \\ \hline \end{array}$
Assume that processes being scheduled with Round-Robin Scheduling Algorithm with time quantum $4$ ms. Then the waiting time for $P_4$ is ______ ms
Time quantum is $4$, assuming every process arrived at $t=0$
When every process uses $1$ time quantum,
0 4 8 12 16
$P_4$ finished at $t=16$
$waiting\,time= 16-4=12\,ms$
So, $(C)$ should be the answer
64.3k questions
77.9k answers
244k comments
80.0k users