Question

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

The question was posed to me in quiz.

This key question is from CPU Scheduling Algorithms-1 topic in section CPU Scheduling of Operating System

Answer 1

The correct option is (a) using very large time slices converts it into First come First served scheduling algorithm

Best explanation: All the processes will be able to get completed.