Round Robin
For this algorithm the system allocates CPU time to all processes in the Queue. For ex. P1 will be first processed with the first CPU burst C1 and put back on the Queue ( If the process didn’t reach the end) and process P3 is served with the second CPU burst C2 etc. This goes on till all the processes in the Queue are serviced fully till they terminate.