Question

Consider three processes P1, P2, P3 with burst times 10,

5, 8 milliseconds respectively. All arrive at time 0. If they are scheduled using the Shortest Job First (SJF) non-preemptive algorithm, what is the average waiting time?

A 4.33 ms

B 6.00 ms

C 7.00 ms

D 7.67 ms

E 8.33 ms

Practice Next

More IT Operating System Questions

Simplify the following expressions and choose the correct option.

18 * 15 - {3/5 of 250 + 7²}
Simplify the given expression.
If 1560 ÷ 30 + 2025 ÷ 45 - z + 33 × 7 = 1848 ÷ 24 × 234 ÷ 39, then the value of z is:
2350 – 4830 + 9570 + 3350 – 1720 = ?
What should come in place of (?) question mark in the given expression.

[60% of 350 + (2/7 of 210)] ÷ 5 = ?
15% of 1800 + 2² = ?
Calculate the value of this expression:

(180 - 90 ÷ 6 of 2) ÷ 5 + 3 of 16 ÷ 4 - 12 of 4 ÷ 8
(7/5) × (3/4) × (5/9) × (6/7) × 3112 = ?
Determine the value of 'p' in following expression:

720 ÷ 9 + 640 ÷ 16 - p = √121 X 5 + 6²- 7

Consider three processes P1, P2, P3 with burst times 10,

Solution