Question: QUESTION 4 Consider a system with five processes P1 through P5, Arrival time, Burst time and Priority stated in the table. Process Arrival Time Burst

QUESTION 4 Consider a system with five processes P1 through P5, Arrival time, Burst time and Priority stated in the table. Process Arrival Time Burst Time 0 7 Priority 5 2 1 1 Pi P2 P3 P4 P5 4 2 8 3 2 3 A 4 3 4 a) Draw Gantt charts that illustrate the execution of the processes using preemptive Shortest Job First and Round Robin (with time quantum = 3) scheduling algorithms. (4 Marks) b) Compare between the scheduling algorithms based on their average waiting time. (6 Marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
