With round robin scheduling algorithm in a time shared system ____________a.using very large time slices converts it into First come First served scheduling algorithmb.using very small time slices converts it into First come First served scheduling algorithmc.using extremely small time slices increases performanced.using very small time slices converts it into Shortest Job First algorithmClear my choice

The correct answer is:

a. Using very large time slices converts it into First come First served scheduling algorithm

Explanation:

Round Robin scheduling algorithm is a pre-emptive algorithm that is designed especially for time-sharing systems. It is simple, easy to use, and starvation-free as all processes get fair share of CPU.

1. If we use very large time slices, the Round Robin scheduling algorithm essentially becomes a First Come First Serve scheduling algorithm. This is because each process will likely finish its execution before the time slice expires, so the next process in the queue will not start until the first one has finished, just like in FCFS.

2. Using very small time slices does not convert it into First come First served scheduling algorithm. Instead, it could lead to more context switches which could decrease overall system performance due to overhead.

3. Using extremely small time slices does not necessarily increase performance. In fact, it could decrease performance due to the overhead of more frequent context switches.

4. Using very small time slices does not convert it into Shortest Job First algorithm. SJF algorithm works on the principle of executing the shortest jobs first, which is not related to the time slice size in Round Robin.