試題詳解

(十) Consider this set of process pi, where P={p₁, p₂, p₃, p₄}, as show in Table 1. The processes are assumed to have arrived in the order p₁, p₂, p₃, p₄. What is the average waiting time for preemptive SJF (shortest job first) algorithm?
(A) 9
(B)7
(C) 11.25
(D) 11.5