Q9 : Assume the Following Process. Process Burst Time Priority Arrival Time
P1 16 3 0
P2 3 1 5
P3 5 5 8
P4 6 4 4
P5 11 2 6
For the set of processes directly above, draw a Gantt chart for the Round Robin
Scheduling Algorithm using. CS=0
a) For the set of processes directly above, draw a Gantt chart for the the Round
Robin Algorithm for a time quantum of q= 5 ms.
b) For the set of processes directly above, calculate the throughput for the
Round Robin Algorithm for a time quantum of 5 ms.
c) For the set of processes directly above, calculate the turnaround time for the
Round Robin Algorithm for a time quantum of 5 ms.
d) For the set of processes directly above, calculate the average turnaround
time for the Round Robin Algorithm for a time quantum of 5 ms.
e) For the set of processes directly above, calculate the waiting time for the
Round Robin Algorithm for a time quantum of 5 ms.
f) For the set of processes directly above, calculate the average waiting
time for the Round Robin Algorithm for a time quantum of 5 ms.
g) What will happen if the time quantum for the Round Robin Algorithm is too
small?
h) What will happen if the time quantum for the Round Robin Algorithm is too
large?
i) What is the CPU Utilization for the system?
Q 10: Repeat Q9 with CS=1