Q
With round robin scheduling algorithm in a time shared system ____________
-
A
A. Using very large time slices converts it into first come first served scheduling algorithm
-
B
B. Using very small time slices converts it into first come first served scheduling algorithm
-
C
C. Using extremely small time slices increases performance
-
D
D. Using very small time slices converts it into shortest job first algorithm
Correct Answer:
A. A. Using very large time slices converts it into first come first served scheduling algorithm
Explanation:
All the processes will be able to get completed.
