In: Computer Science
An operating system uses the Round Robin (RR) without priority CPU scheduling algorithm, with a quantum = 4.
Consider the following set of processes in this OS, with the length of the CPU burst time given in milliseconds, and the shown priority.
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
Process | Burst Time | Priority |
P1 | 5 | 2 |
P2 | 10 | 5 |
P3 | 4 | 1 |
P4 | 6 | 4 |
P5 | 9 | 3 |
a) Draw a Gantt chart illustrating the order of execution of these processes, showing their completion times.
b) Calculate each process’ waiting time, and then compute the average waiting time for this set.
Note: waiting time = completion time – arrival time – burst time
=> Write your answers on scratch paper (make sure it is visible) then take a picture of it and upload it here.
The solution is given below , hope this will help you
Note : Ignore the Turn around time
Thank you!