Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way. It is basically the preemptive version of First come First Serve CPU Scheduling algorithm . Round Robin CPU Algorithm generally focuses on Time Sharing technique. The period of time for which a process or job is allowed to run in a pre. Prerequisite Round Robin Scheduling with arrival time as 0 Round robin scheduling algorithm is used to schedule process fairly each job a time slot or quantum and theThe aim The basic scheduling algorithms are First Come First Serve (FCFS), Round Robin , Priority Based Scheduling , Shortest Job First (SJF) etc. Introduction. Round-robin scheduling algorithm is one of the simplest scheduling algorithms. It is designed especially for time-sharing systems. The ready queue is treated as a circular queue. The algorithm assigns a time slice (also called time quantum) to each process in the ready queue in order, handling all processes without priority. Round robin is the scheduling algorithm used by the CPU during execution of the process . Round robin is designed specifically for time sharing systems . It is similar to first come first serve scheduling algorithm but the preemption is the added functionality to.