Preemptive scheduling with a configurable time quantum. Processes take turns — fairest scheduling algorithm.
PreemptiveConfigurable QuantumAnimated Gantt
Round Robin: Each process gets a fixed time quantum. If it doesn't finish, it goes to the back of the queue and waits for another turn.
Key Insight: Smaller quantum → fairer but more context switches. Larger quantum → degenerates to FCFS.
Response Time = (Position in queue) × Q