Round-robin scheduling
A. allows interactive tasks quicker access to the processor
B. is quite complex to implement
C. gives each task the same chance at the processor
D. allows processor-bound tasks more time in the processor
E. None of the above
Answer: Option C
Solution (By Examveda Team)
Round-robin scheduling gives each task the same chance at the processor. The simplest preemptive scheduling algorithm is round-robin, in which the processes are given turns at running, one after the other in a repeating sequence, and each one is preempted when it has used up its time slice.This Question Belongs to Computer Fundamentals >> Operating System
Join The Discussion