With Round-Robin CPU scheduling in a time shared system
- A. using very large time slices (quantas) degenerates into First-Come First Served (FCFS) algorithms.
- B. using extremely small time slices improves performance
- C. using very small time slices degenerates into Last-in First-Out (LIFO) algorithm.
- D. using medium sized times slices leads to shortest Request time First (SRTF) algorithm
Answer: A. using very large time slices (quantas) degenerates into First-Come First Served (FCFS) algorithms.
Explanation: If the time quantum is larger than the burst time of all processes, RR becomes FCFS.