IIT Kanpur

Question

Consider a process with a single CPU burst of 100 time units and a single disk I/O of 1000 time units at the end. If the timer interval is fifteen time units and the process scheduling algorithm is round-robin, at most how many times would the process enter the ready queue before entering the terminated state? Assume that there is a sufficiently large number of processes of similar nature trying to run on the CPU._________

Comments

But assume after I/o it goes to ready,but now how will it goto terminated?It do not want to go into running and there is no transitions to  terminated except running

---

i think it should be 8.

for max no, execution can be assume to be done in this way.

Burst Time	I/O Time	Burst Time
76	1000	24

so, 15 + 15 + 15 + 15 + 15 + 1 (6 time in Ready Queue) + 1000 (I/O) + 15 + 9 (2 time in Ready Queue).

so at max it can be 8.

---

After ready, it will have to go to running state with 0 burst time to go to terminate state. It can't go directly. The question specifically mentions terminate state.