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
Explanation: In round robin algorithm, the size of time quanta plays a very important role as:
If size of quanta is too small: Context switches will increase and it is counted as the waste time, so CPU utilization will decrease.
If size of quanta is too large: Larger time quanta will lead to Round robin regenerated into FCFS scheduling algorithm.
So, option (D) is correct.
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.