**Round Robin Scheduling and Time Slice**

Round Robin scheduling is a popular CPU scheduling algorithm used in operating systems. It is a preemptive scheduling algorithm that is designed to provide fair and equal access to the CPU for all processes.

In Round Robin scheduling, the processes are executed in a cyclic manner, where each process is given a fixed time slice or time quantum to execute. The time slice is denoted by 'Q' units. Once a process exhausts its time slice, it is preempted and moved to the end of the ready queue, allowing the next process in the queue to execute.

**Interrupt and CPU Reassignment**

In the worst case scenario, when a process is interrupted and preempted after utilizing its entire time slice, it will have to wait until it gets the CPU again. The time it takes for the interrupt process to get the CPU again depends on the number of processes in the ready queue.

Let's consider a scenario where there are 'n' number of processes in the ready queue and the time slice is 'Q' units. When a process is interrupted after utilizing its entire time slice, it is moved to the end of the queue. The subsequent processes in the queue will get a chance to execute until it reaches the interrupted process again.

To calculate the time it takes for the interrupt process to get the CPU again, we need to consider the following factors:

1. Number of processes in the ready queue (n)
2. Time slice for each process (Q)

**Calculating the Time for Interrupt Process to Get the CPU Again**

To calculate the time for the interrupt process to get the CPU again, we can use the formula:

Time taken = (n - 1) * Q

Here, (n - 1) represents the number of processes that need to execute before the interrupt process gets the CPU again. Multiplying it with the time slice (Q) gives us the total time taken.

For example, if there are 5 processes in the ready queue and the time slice is 10 units, the interrupt process will get the CPU again after:

Time taken = (5 - 1) * 10 = 40 units

Therefore, in the worst case scenario, the interrupt process will get the CPU again after 40 units of time.

**Conclusion**

In Round Robin scheduling, the interrupt process will get the CPU again after a certain amount of time, which depends on the number of processes in the ready queue and the time slice assigned to each process. By using the formula (n - 1) * Q, we can calculate the time taken for the interrupt process to get the CPU again.