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$3,$ P$4,$ P$5,$ P$6$ and P$7$ as shown in the following table. All the I$/$O operations are

carried out on different devices.

At time t$=14,$ the process running will ask for some I$/$O$.$ The I$/$O operation takes $14$ time units to complete.

At time t$=16,$ the process running will ask for some I$/$O$.$ The I$/$O operation takes $14$ time units to complete.

At time t$=38,$ the process running will ask for some I$/$O$.$ The I$/$O operation takes $7$ time units to complete.

At time t$=61,$ the process running will ask for some I$/$O$.$ The I$/$O operation takes $7$ time units to complete.

KINDLY NOTE:

$$ In case you encounter a situation wherein at time t $=$ x$,$ process PA finishes its time quantum and

an I$/$O operation is requested at the same time, then under such circumstances, PA should be sent

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

Process ID Arrival Time Burst Time

P$1$ t$=015$

P$2$ t$=713$

P$3$ t$=921$

P$4$ t$=419$

P$5$ t$=318$

P$6$ t$=357$

P$7$ t$=5114$

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

B$)$ Calculate the Waiting Time for each process. $(5$ points$)$

C$)$ Calculate the Response Time for each process. $(5$ points$)$

D$)$ Calculate the Turn$-$Around Time for each process. $(5$ points$)$