Anonymous user menu

Time when the process get the CPU again
In Round-Robin scheduling there are 'n' number 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) (n * q) units
(c) (q-1) * n units
(d) (q+1) * n units
Answer. (a)
Suppose that the process has arrived in the ready queue then it will arrive after (n-1) processes in the worst case in the ready queue so for each process it has to wait q time slice units.Hence for a total of (n-1) processes it has to wait (n-1) * q time units.