In Round-Robin Scheduling the round-robin (RR) scheduling algorithm is designed especially for time- sharing systems. It is similar to FCFS scheduling but preemption is added to switch between processes. A small unit of time, called a time quantum (or time slice) is defined. The ready queue is treated as a circular queue. The CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval of up to 1 time quantum. To implement RR scheduling, we keep ready queue as a FIFO queue of processes. New processes are added to the tail of the ready queue. The CPU scheduler picks the first process from the ready queue, sets a timer to interrupt after 1 time quantum, and then dispatches the process. According to the given scenario how we illustrate the working of the RR algorithm by using the following system state. Also find the complete time, TAT, WT, RT, Avg TAT, Avg WT for these process in preemptive mode Here TQ=2 Process Arrival Time Burst Time P1 0.0 7 P2 2.0 4 P3 3.0 1 P4 4.0 3 3 P5 0.0 3