SDE - Intern

You have been given the ‘N’ process with process id’s from 1 to ‘N’. For each process, you are given the arrival time and burst time. You are also provided with the time quantum. Now you are supposed to execute a round-robin scheduling algorithm and find the completion time for each given process.

Please refer to Round-robin_scheduling for more detailed information .

Note:

A time quantum is associated with the algorithm. Each process gets CPU for some units of time, which are decided by time quantum value, and then again enter the ready queue if they have burst time remaining.

Arrival Time - The time when the process enters the system and is ready for execution.

Burst Time - The total time taken by the process for execution.

Completion Time - The time when the process completes its execution and leaves the system.

Note:

If two processes are having the same arrival time, then a process with a lower ID will be executed first.