$1$ Find Waiting Time

Create an array rem$\_$bt$[]$ to keep track of remaining burst time of processes. This array is initially a copy of plist$[].$bt $($all processes burst times$)$

Store waiting times of processes in plist$[].$wt$.$ Initialize this array as $0.$

Initialize time : t $=0$

Keep traversing the all processes while all processes are not done. Do following for i$$th process if it is not done yet.

If rem$\_$bt$[$i$]>$ quantum

$($i$)$ t $=$ t $+$ quantum

$($ii$)$ bt$\_$rem$[$i$]-=$ quantum;Else $//$ Last cycle for this process

$($i$)$ t $=$ t $+$ bt$\_$rem$[$i$]$;

$($ii$)$ plist$[$i$].$wt $=$ t $-$ plist$[$i$].$bt

$($ii$)$ bt$\_$rem$[$i$]=0$; $//$ This process is over

$2$ Find Turn Around Time

Once we have waiting times, we can compute turn around time tat of a process as sum of waiting and burst times, i$.$e$.,$ plist$[$i$].$wt $+$ plist$[$i$].$bt