Final answer:
In Round Robin scheduling, the previous stage or state of the process is stored in a round-robin queue. This queue keeps track of all the processes that are waiting to be executed and cycles through them in a circular manner.
Step-by-step explanation:
In Round Robin scheduling, the previous stage or state of the process is stored in a data structure known as a round-robin queue. This queue keeps track of all the processes that are waiting to be executed and cycles through them in a circular manner.
The round-robin queue stores each process along with its current execution state, such as the amount of time it has already been running. When a process's turn comes, it is removed from the queue, executed for a predetermined time slice, and then placed back at the end of the queue.
This process ensures that all processes get a fair share of CPU time and helps prevent any single process from monopolizing resource