Question: Question 14: Consider a non-preemptive version of PRIORITY scheduling algorithm with the following data Process Execution time Arrival time Priority P: 5 1 3 P2

Question 14: Consider a non-preemptive version of PRIORITY scheduling algorithm with the following data Process Execution time Arrival time Priority P: 5 1 3 P2 4 3 1 P 6 0 4 P. 3 2 5 PS 7 3 1. Illustrate the Gantt chart 4 O 2. Calculate the waiting time of each process 3. Calculate the average waiting time Question 15: Consider a preemptive version of PRIORITY scheduling algorithm with the following data Process Execution time Arrival time Priority PA 5 1 3 Pa 3 1 P 0 PA 3 5 PS 7 4 3 1. illustrate the Gantt chart 4 6 2 2. Calculate the waiting time of each process 3. Calculate the average waiting time 4. Calculate the average waiting time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
