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.

Join The Discussion

Related Questions on Operating System

Identify false statement

A. You can find deleted files in recycle bin

B. You can restore any files in recycle bin if you ever need

C. You can increase free space of disk by sending files in recycle bin

D. You can right click and choose Empty Recycle Bin to clean it at once