GATE CS previuos year question but with change :Operating System

Question

Q.1 In round-robin scheduling there are 'n' no. of processes in ready queue and time slice is 'q' units in worst case, the interrupted process will get the CPU again after

(a) (n-1)q units

(b) nq units

(c) (q-1)n units

(d) (q + 1)n units

(PLEASE Answer with Explanation if possible )

Comments

let p1, p2,...pn are processes.

If p1 get a chance now, after p2,...pn (total n-1 processes) runs one time slice, p1 will get again chance.

Option A is correct.

---

Please add a link to the original question too while asking a related question.