Question

Consider the following set of processes, with the length of the CPU burst given in seconds:

Process Burst time Arrival time
P1 10 1
P2 04 2
P3 05 3
P4 03 4

a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF preemptive and Round Robin (quantum = 3).
b) What is the turnaround time of each process for each of the scheduling algorithms in part a?
c) What is the waiting time of each process for each of these scheduling algorithms?
d) Which of the algorithms results in the minimum average waiting time (over all processes)?
e) Which of the algorithms results in the minimum average turnaround time (over all processes)?

Answer 1

Answer:

urd7tbig ydgiyc7rviy yes6rfirese7xeyzyecurz7rxirc8r