The sequence .............. is an optimal non-preemptive scheduling sequence…

PYQ GATE 1995

The sequence .............. is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ........................ unit(s) of time.

Job | Arrival time | Burst time
1 | 0.0 | 9
2 | 0.6 | 5
3 | 1.0 | 1

  1. A.

    {3,2,1},1

  2. B.

    (2,1,3),0

  3. C.

    {3,2,1},0

  4. D.

    {1,2,3},5

Attempted by 141 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…