Question: Process P2 PO Pl P3 P4 Burst Time 6 4 3 5 6 Priority 4 2 4 5 1 Arrival time 3 2 5

Process P2 PO Pl P3 P4 Burst Time 6 4 3 5

Process P2 PO Pl P3 P4 Burst Time 6 4 3 5 6 Priority 4 2 4 5 1 Arrival time 3 2 5 6 4 a. Find out average waiting time using preemptive priority algorithm. If priorities are equal for multiple processes then use preemptive SJF. [gantt chart is required] 5 b. Find out average waiting time using preemptive SJF algorithm. If burst times are equal for multiple processes then use preemptive priority. [gantt chart is required] 5

Step by Step Solution

3.38 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

1 a Process P2 PI P3 Po 2 4 Py B T 6 4 3 5 6 2 Prouty 4 Here we will e ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Operating System Questions!