In: Computer Science
Solve the the process scheduling problem using the round robin FCFS algorithm studied in assignment 7. The program will show the order of execution of the processing and will provide the average waiting time for the following scenarios:
a) Time quantum =1
b) Time Quantum=3
Use the table below to draw the Gantt Chart (Spread sheet or by hand).
Process ID | Arrival Time | Burst Time |
1 | 0 | 4 |
2 | 1 | 5 |
3 | 2 | 2 |
4 | 3 | 1 |
5 | 4 | 6 |
6 | 6 | 3 |
7 | 7 | 2 |