fork.science

Question: What is not true about Round Robin (RR) scheduling?

A RR prioritises tasks that were scheduled longest ago (breaks ties based on ordering of tasks) B RR keeps CPU idle till end of time quantum if scheduled task is waiting
C RR changes scheduled task in each time quantum D RR preempts each task after end of time quantum
E RR tends to give tasks more equal share than first-come first-served