Q1. Explain Round Robin Scheduling.
Ans. One of the oldest, simplest, fairest, and most widely used algorithms is round robin.
In this approach, a “time slice” is defined, which is a particular small unit of time. In each time slice, the CPU executes the current process until the end of the time slice. If that process is done, it is discarded and the next one in the queue is dealt with. However, if the process isn’t done, it is halted and put at the back of the queue and then the next process in line is addressed during the next time slice.