1 votes 1 votes 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. Operating System round-robin-scheduling + – manu nandhan asked Oct 30, 2017 manu nandhan 428 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply aehkn commented Oct 30, 2017 reply Follow Share Seems valid to me too 1 votes 1 votes Tesla! commented Oct 30, 2017 reply Follow Share Yes it will, we can say that RR will have preemptive nature 0 votes 0 votes AskHerOut commented Oct 30, 2017 reply Follow Share 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. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 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. Purva Taranekar answered Sep 29, 2018 reshown Oct 1, 2018 by Purva Taranekar Purva Taranekar comment Share Follow See all 0 reply Please log in or register to add a comment.