A CPU scheduling system uses the SJF algorithm. Initially, at time 0 (t=0), the

Question

A CPU scheduling system uses the SJF algorithm. Initially, at time 0 (t=0), the ready queue is empty. (The unit of time measurement is 1 millisecond.) At t=2, process A with a burst time of 6 arrives at the ready queue. At t=4, process B with a burst time of 8 arrives. At t=6, process C with a burst time of 4 arrives. No other processes come to the ready queue until t=20.
What is the average length of the ready queue between t=0 and t=20?
Choose one answer.
a. 2.0
b. 0.5
c. 9.333...
d. 3.333...
e. None of the above.

Explanation / Answer

Answer : b   0.5

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.