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
Answer: D. the size of the time quantum
Explanation: If the time quantum is too large, it behaves like FCFS. If too small, context switch overhead dominates.