The round robin CPU scheduling in a time-shared system is done

A. using very large time slice degenerates in to first come first served algorithm.
B. using extremely small time slices improve performance.
C. using extremely small time slices degenerate in to last in first out algorithm.
D. using medium sized time slices leads to shortest request time first algorithm.

error: Content is protected !!