Consider the following set of processes, with the length of the CPU burst

time given in milliseconds:

Process Burst Time Priority

P1 7 5

P2 2 4

P3 11 3

P4 9 1

P5 5 3

The processes are assumed to have arrived in the order P1,P2, P3, P4, P5,

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 smaller priority number implies a higher

priority), and RR (quantum = 2).

FCFS: Enter the order of the processes

Enter times for above chart starting with 0

SJF: Enter the order of the processes

Enter the times for the above chart starting with 0

Priority: Enter the order of the processes

Enter the times for the above chart starting with 0

Round Robin: Enter the order of the processes

Enter the times for the above chart starting with 0

b. What is the turnaround time of each process for each of the

scheduling algorithms in part a?

X	FCFS	SJF	PRI	RR
P1
P2
P3
P4
P5

c. What is the waiting time of each process for each of these scheduling

algorithms?

x	FCFS	SJF	PRI	RR
P1
P2
P3
P4
P5

d. Which of the algorithms results in the minimum average waiting

time (over all processes)?