Draw your Gantt charts using the following format modified to be computer friendly:

1123344433113222441... <- process scheduled to run during the time unit 123456789012345678901234567890123456789012345678901234567890 <- time unit scale

1 2 3 4 5 6

Use the following process information:

Process , CPU Burst Time , Priority

1 2 4

2 1 2

3 4 3

4 3 1

Questions:

1. For the FCFS scheduling algorithm, draw the Gantt chart that illustrates the execution of these processes (until all have completed their CPU burst time). Assume processes have arrived in order 1, 2, etc.

2. For the SJF scheduling algorithm, draw the Gantt chart that illustrates the execution of these processes (until all have completed their CPU burst time). Assume the scheduler has accurate burst time estimates for the processes.

3. For the nonpreemptive priority scheduling algorithm, draw the Gantt chart that illustrates the execution of these processes (until all have completed their CPU burst time). Assume a larger priority number means higher piority.

4. For the round robin scheduling algorithm, draw the Gantt chart that illustrates the execution of these processes (until all have completed their CPU burst time). Use a time quantum of 2 time units.

5. For the FCFS algorithm, compute the turnaround time of each process and the average turnaround time for all the processes.

6. For the SJF algorithm, compute the turnaround time of each process and the average turnaround time for all the processes.

7. For the nonpreemptive priority algorithm, compute the turnaround time of each process and the average turnaround time for all the processes.

8. For the round robin algorithm, compute the turnaround time of each process and the average turnaround time for all the processes.

9. For the FCFS algorithm, compute the waiting time of each process and the average waiting time for all the processes.

10. For the SJF algorithm, compute the waiting time of each process and the average waiting time for all the processes.

11. For the nonpreemptive priority algorithm, compute the waiting time of each process and the average waiting time for all the processes.

12. For the round robin algorithm, compute the waiting time of each process and the average waiting time for all the processes.