With Round-Robin CPU scheduling in a time shared system
2008
With Round-Robin CPU scheduling in a time shared system
- A.
using very large time slices (quantas) degenerates into FirstCome First served (FCFS) algorithm.
- B.
using extremely small time slices improves performance
- C.
using very small time slices degenerates into Last-In First-Out (LIFO) algorithm.
- D.
using medium sized times slices leads to shortest Request time First (SRTF) algorithm
Attempted by 208 students.
Show answer & explanation
Correct answer: A
In Round-Robin scheduling, processes are executed in cyclic order with a fixed time quantum. When the time quantum is very large (larger than all process burst times), no preemption occurs because each process completes its CPU burst before the time slice expires. Consequently, processes are served strictly in the order of their arrival, making Round-Robin behavior identical to First-Come, First-Served (FCFS) scheduling in this specific scenario.
A video solution is available for this question — log in and enroll to watch it.