Question

‘‘Round Robin Algorithm is non-pre-emptive’’ Comment and justify.

Answer 1

RR Scheduling algorithm is preemptive because no process is allocated to the CPU for more than one time quantum in a row. If a process CPU burst exceeds 1 time quantum, that process is pre-empted and is put back in ready queue