The following processes have 4 CPU burst and 3 I/O bursts each. They are all of the same priority and they arrive in the order P1, P2, P3 at time 0.

For the questions above that involve Gantt charts, you can draw them approximately specially for round robin that is for RR you do not have to show every context switch.

5. The following processes have 4 CPU burst and 3 I/O bursts each. They are all of the same priority and they arrive in the order P1, P2, P3 at time 0 CPU 10 CPU 10 CPU 10 I/o 10 CPU 10 10 10 P1 P2 P3 10 5 10 5 10 a. Draw three Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 1t) scheduling c. What is the turnaround time of each process for each of the scheduling algorithms in part (a)