# Online Test series

1 vote
114 views
Ques: Can Round Robin algorithm be non-preemptive ?

My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptive

Am I right ? Please corret me if am wrong.
1
Seems valid to me too
0
Yes it will, we can say that RR will have preemptive nature
0
Its inherent nature will still be preemptive. Just the fact that no other process is longer than its quantum can not make it non-preemptive, though it won't get chance to preempt any process.

1 vote
If tq= q, where q is very large, but at the same time, first process happens to be of burst =q+1, then just for 1 unit time it would get preempted making the algorithm preemptive.

reshown

## Related questions

1
246 views
Consider a system having $10$ IO bound jobs and $1$ CPU bound job.. If IO bound job issue an IO request once for every ms of CPU computation and that each IO request takes $10$ ms. If context switch overhead is $0.1$ ms.Using round -robin scheduling with a time quantum of $10$ ms. , the CPU efficiency is __________________
–1 vote