Which CPU scheduling algorithm is best for an interactive time-sharing OS to ensure quick response time?

💡 Explanation:

Round Robin (RR) is a preemptive scheduling algorithm specifically designed for time-sharing systems. It assigns a fixed time slice (quantum) to each process, ensuring that every process receives a fair share of the CPU at regular intervals. This preemption and fair distribution minimize the average response time for interactive users, preventing any single process from monopolizing the CPU.