Question: Process Arrival time Burst Time Priority P0 0 ms 9 ms 1 P1 1 ms 4 ms 3 P2 2 ms 9 ms 2 Given

Process Arrival time Burst Time Priority
P0 0 ms 9 ms 1
P1 1 ms 4 ms 3
P2 2 ms 9 ms 2

Given the previous table, which scheduling algorithm satisfies the requirement of minimum waiting time?

a.

FCFS

b.

SJF

c.

Priority scheduling

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Databases Questions!