Q. With round-robin CPU scheduling in a time shared system (Solved)
1. using very large time slices degenerates into First-Come First Served Algorithm
2. using extremely small time slices improves performance
3. using very small time slices degenerate into Last-In-First-Out algorithm
4. using medium sized time slices leades to Shortest Request Time First algorithm.
- a. using very large time slices degenerates into First-Come First Served Algorithm