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

Process	Burst	Priority
P1	32	4
P2	24	1
P3	4	2
P4	36	2
P5	12	3

 

 

 

 

NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.

• Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8).
• What is the turnaround time of each process for each of the scheduling algorithms in part a?
• What is the waiting time of each process for each of these scheduling algorithms?
• Which of the algorithms results in the minimum average waiting time (over all processes)?
• Which of the algorithms results in the minimum average turnaround time (over all processes)?

Answer rating: 100% (QA)

Answer We are given a set of processes with their burst time and priority we need to draw gantt chart of these processes by each of the following process scheduling algorithms 1 First Come First Serve... View the full answer