In round robin algorithm time slices are assigned to each process in equal portions and in circular order, handling all processes without priority. Round-robin scheduling is simple, easy to implement, and starvation-free.
Let us consider that there are 4 jobs :A,B,C,D.
Round Robin will give each job the same amount of CPU time until they are finished. Cycle goes like A B C D A B C D for two cycles.If one of the jobs finishes it will be removed from the queue. If a job is added it will be added to the circular queue.
Login to rate this answer.