Python

Change the code to repeatedly execute the code with different time quantum value to be obtained from user input. To repeat execution, ask the user whether to continue or not $($Y$$ to repeat, exit otherwise$).$ Changes required are marked by #NOTE within the code.

def round$\_$robin$\_$scheduling$($processes$,$ quantum$)$:

n $=$ len$($processes$)$

rem$\_$burst$\_$times $=[$p$[1]$ for p in processes$]$

waiting$\_$time $=[0]*$ n

turnaround$\_$time $=[0]*$ n

t $=0$ # Current time

order $=[]$ # To track the order of execution

while any$($rem$\_$burst$\_$times$[$i$]>0$ for i in range$($n$))$:

for i in range$($n$)$:

if rem$\_$burst$\_$times$[$i$]>0$:

process$\_$executed $=$ False

if rem$\_$burst$\_$times$[$i$]>$ quantum:

#NOTE: do the change here to track the execution order

t $+=$ quantum

rem$\_$burst$\_$times$[$i$]-=$ quantum

process$\_$executed $=$ True

else:

#NOTE: do the change here to track the execution order

t $+=$ rem$\_$burst$\_$times$[$i$]$

waiting$\_$time$[$i$]=$ t $-$ processes$[$i$][1]$

rem$\_$burst$\_$times$[$i$]=0$

process$\_$executed $=$ True

if process$\_$executed:

#NOTE: do the required change here

#NOTE: print a message "Process executed for units"

pass

# Calculate turnaround time

for i in range$($n$)$:

turnaround$\_$time$[$i$]=$ processes$[$i$][1]+$ waiting$\_$time$[$i$]$

# Calculate average times

avg$\_$waiting $=$ sum$($waiting$\_$time$)/$ n

avg$\_$turnaround $=$ sum$($turnaround$\_$time$)/$ n

# Display results

print$("$

Process ID$\backslash$tBurst Time$\backslash$tWaiting Time$\backslash$tTurnaround Time"$)$

for i in range$($n$)$:

print$($f$"\{$processes$[$i$][0]\}\backslash$t$\backslash$t$\{$processes$[$i$][1]\}\backslash$t$\backslash$t$\{$waiting$\_$time$[$i$]\}\backslash$t$\backslash$t$\{$turnaround$\_$time$[$i$]\}")$

print$($f$"$

Average Waiting Time: $\{$avg$\_$waiting$\}")$

print$($f$"$Average Turnaround Time: $\{$avg$\_$turnaround$\}")$

# Print execution order and number of context switch

print$("$

Execution Order $($Process ID$,$ Time Units$)$:$")$

#NOTE do the required change here

if $\_\_$name$\_\_==\text{'}\_\_$main$\_\_\text{'}$:

#NOTE do the required change here

# List of processes $[$process$\_$id$,$ burst$\_$time$]$

# Assuming same initial arrival time for all process

processes $=[[1,10],[2,1],[3,2],[4,1],[5,5]]$

quantum $=2$

round$\_$robin$\_$scheduling$($processes$,$ quantum$)$