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:A
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
Explanation: All the processes will be able to get completed.