Python

Change the code further to store the execution order of the processes in the order$[]$ array. Print the execution order and number of context switch.

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:

# Track the execution order

t $+=$ quantum

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

process$\_$executed $=$ True

order.append$(($processes$[$i$][0],$ quantum$))$

else:

# Track the execution order

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

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

order.append$(($processes$[$i$][0],$ rem$\_$burst$\_$times$[$i$]))$

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

process$\_$executed $=$ True

if process$\_$executed:

# Print a message "Process executed for units"

print$($f$"$Process $\{$processes$[$i$][0]\}$ executed for $\{$order$[-1][1]\}$ units"$)$

# 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$)$:$")$

for p in order:

print$($f$"$Process $\{$p$[0]\}$ executed for $\{$p$[1]\}$ units"$)$

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

# 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]]$

while True:

# Ask user to input time quantum

quantum $=$ int$($input$("$Enter time quantum: $"))$

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

# Ask user whether to continue or not $($Y$$ to repeat, exit otherwise$)$

end$\_$q $=$ input$("$Do you want to continue? $($Y$$ to repeat, exit otherwise$)")$

if end$\_$q $!=\text{'}$Y$\text{'}$:

break