Consider the following set of processes with the length of CPU burst time in milliseconds (ms) $:$
$\begin{array}{|l|l|l|l|l|l|l|} \hline \textbf{Process} & \text{A} & \text{B} & \text{C} & \text{D} & \text{E} \\\hline \textbf{Burst time} & \text{6} &\text{1} & \text{2} & \text{1} & \text{5} \\\hline \textbf{Priority} & \text{3} & \text{1} & \text{3} & \text{4} & \text{2} \\\hline \end{array}$
Assume that processes are stored in ready queue in following order $:$
$\text{A – B – C – D – E}$
Using round robin scheduling with time slice of $1$ ms, the average turn around time is
Since the arrival time of all the process are 0, hence all red mark shows the turn around time of the process.
T.A.T of A = 15
T.A.T of B = 1
T.A.T of C = 8
T.A.T of D = 5
T.A.T of E = 13
Average T.A.T = (15+1+8+5+13)/5 = 42/5= 8.4.
Ans- A.
ans will be A 8.4 ms
64.3k questions
77.9k answers
244k comments
80.0k users