ISRO CSE 2008 | Question: 66, ISRO CSE 2009 | Question: 15

Question

The performance of Round Robin algorithm depends heavily on

• A. size of the process
• B. the I/O bursts of the process
• C. the CPU bursts of the process
• D. the size of the time quantum

Comments

Size of a process, it's CPU and IO burst have no effect on the performance of any CPU scheduling algorithm. 

For Round Robin time quantam is the major factor for determining it's performance as on increasing it will degenerate scheduling to FCFS and on increasing it will leads to more context switching. 

Answer 1

The performance of Round Robin algorithm depends heavily on the size of the time quantum.

If time quantum is too large, RR reduces to the FCFS algorithm

If time quantum is too small, overhead increases due to amount of context switching needed.

So option D is correct.

Comments

But also depends on the size of the process and CPU Bursts of the process. But yeah, time quantum is the dominating factor.

Answer 2

D is correct