Question
Algorithms Question on Algorithm design techniques
| Consider the following table of arrival time and burst time for three process Po P1 and P2Process | Arrival Time | Burst Time |
|---|---|---|
| Po | 0 ms | 9 ms |
| P1 | 1 ms | 4 ms |
| P2 | 2 ms | 9 ms |
The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. What is the average waiting time for the three process
A
5.0 ms
B
4.33 ms
C
6.33 ms
D
7.33 ms
Answer
5.0 ms
Explanation
Solution
The correct option is(A): 5.0 ms