# Introduction In this lab, we will learn how to implement the Round Robin Scheduling Algorithm in C++. Round Robin Scheduling algorithm is a preemptive algorithm in which a process is executed for a fixed time slice known as a time quantum. If the process completes its execution within the time quantum, it gets terminated, otherwise, it is shifted to the end of the ready queue.
Click the virtual machine below to start practicing