

MCQOPTIONS
Saved Bookmarks
1. |
With round robin scheduling algorithm in a time shared system ____________ |
A. | using very large time slices converts it into First come First served scheduling algorithm |
B. | using very small time slices converts it into First come First served scheduling algorithm |
C. | using extremely small time slices increases performance |
D. | using very small time slices converts it into Shortest Job First algorithm |
Answer» B. using very small time slices converts it into First come First served scheduling algorithm | |