There are five processes P1, P2, P3, P4, and P5, which in turn enter the ready queue at the same time. Their priority number and required processor time are shown in the following table.

Process Burst time       Arrival time

P1          10                       4

P2           1                        1

P3           2                        3

P4           1                        4

P5           5                       2

The wait time and the average wait time of each process in the ready queue when the first-come first-served and non-preemptive-priority scheduling algorithms are used.

 

1)（0+10+11+13+14）/5=9.6

2)（0+1+11+13+18）/5=8.6