Consider a set of 5 processes whose arrival time. CPU time needed and the priority are given below
Process Priority | Arrival Time (in ms) | CPU Time Needed (in ms) | Priority |
P1 | 0 | 10 | 5 |
P2 | 0 | 5 | 2 |
P3 | 2 | 3 | 1 |
P4 | 5 | 20 | 4 |
P5 | 10 | 2 | 3 |
smaller the number, higher the priority.
If the CPU scheduling policy is SJF, the average waiting time (without pre-emption) will be
A. | 16 ms |
B. | 12.8 |
C. | 6.8 ms |
D. | none of these |
Answer : C Explanation : 8 + 0 + 3 + 15 + 8 divided by 5, i.e. 6.8 ms. manoj kumar said: (5:32pm on Tuesday 22nd August 2017)
please explain the above question so that we clearly understand this .
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |