Final answer:
Round robin scheduling falls under the category of non-preemptive scheduling, where each process gets a fixed time slot. The scheduler maintains a ready queue to keep track of the processes.
Step-by-step explanation:
Round robin scheduling falls under the category of non-preemptive scheduling, which means that once a process starts executing, it continues until it completes or reaches a blocking state. Round robin scheduling is a simple and widely used scheduling algorithm in which each process gets a fixed time slot called a time slice or quantum. The time slice is usually small, such as a few milliseconds, and the scheduler maintains a ready queue to keep track of the processes.