Chapter $5$ & $6$

Q$1.$ Considering the following set of processes, with the length of the CPU burst time given in milliseconds:

The processes are assumed to have arrived in the order $P_1,P_2,P_3,P_4,P_5,$ all at time $0.$

a$.$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling

algorithms: FCFS$,$ SJF$,$ nonpreemptive priority $($a larger priority number implies a higher priority$),$ and RR

$($quantum $=2).$

$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$)?$