Q$\mathrm{.}1)$

A system adopts the 'Round Robin' scheduling with a Time Quantum$=4$ wherein the Arrival Time and

Burst Time for each process has been shown in the table below. In a recorded time span, the system has

seven processes, $P_1,P_2,P_2,P_4,P_5,P_8$ and $P_7$ as shown in the following table. All the $\frac{\text{I}}{O}$ operations are

carried out on different devices.

At time $t=14,$ the process running will ask for some $\frac{V}{Q}.$ The $\frac{1}{0}$ operation takes $14$ time units to complete.

At time $t=16,$ the process running will ask for some $\frac{1}{Q}.$ The $\frac{\frac{?}{?}}{O}$ operation takes $14$ time units to complete.

At time $t=36,$ the process running will ask for some $\frac{1}{Q}.$ The $\frac{1}{O}$ operation takes $7$ time units to complete.

At time $t=61,$ the process running will ask for some $\frac{1}{Q}.$ The $\frac{1}{O}$ operation takes $7$ time units to complete.

KINDLY NOTE:

In case you encounter a situation wherein at time $t=x,$ process $P_2$ finishes its time quantum and an $\frac{1}{O}$

operation is requested at the same time, then under such circumstances, $P_2$ should be sent to the blocked

queue $($and not the next process in the ready queue$).$

A$)$ Draw a Gantt Chart $($Timing Diagram$)$ for the above data.

B$)$ Calculate the Waiting Time for each process.

C$)$ Calculate the Response Time for each process.

D$)$ Calculate the Turn Around Time for each process.