Scheduling Checkpoint

Trace arrivals, queue order, handoff costs, and scheduling metrics.


Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. A arrives at 0 with burst 4; B arrives at 2 with burst 1. Quantum is 2 and context cost is 1. Under the exercise rules, which completion times result?

Select one answer.

2. A and B arrive at time 0 in that order, with bursts 3 and 1. C arrives at time 3. Quantum is 1 and context cost is 2. Just after the first switch ends at time 3, what is the ready queue?

Select one answer.

3. A runs 0–2 and finishes; no task is ready then. B arrives at 7 with burst 1. Quantum is 2 and context cost is 4. When does B finish?

Select one answer.

4. A task arrives at 3, first runs at 7, and completes at 15 after using 5 CPU units. Which values are response, turnaround, and waiting time in the single-burst model?

Select one answer.

5. A long saturated run uses full 4-unit slices and a 1-unit switch after each slice. Ignoring startup and final boundaries, what percentage of time does useful CPU work occupy? Enter the number without a percent sign.
6. A complete run has total time 19 measured from time zero, positive bursts summing to 12, and 4 units of charged switches. How many units were idle? Enter an integer.
Join Discord