PART B- 3.Write a python program to demonstrate Round Robin scheduling Algorithm.
 
def findWaitingTime(processes, n, bt, 
						wt, quantum): 
	rem_bt = [0] * n

	# Copy the burst time into rt[] 
	for i in range(n): 
		rem_bt[i] = bt[i]
	t = 0 # Current time 
 
	while(1):
		done = True 
		for i in range(n):			 
			if (rem_bt[i] > 0) :
				done = False # There is a pending process
				
				if (rem_bt[i] > quantum) :
									 
					t += quantum 				  
					rem_bt[i] -= quantum 
						  
				else:			
					 
					t = t + rem_bt[i] 
					 
					wt[i] = t - bt[i] 
					  
					rem_bt[i] = 0
				
		# If all processes are done 
		if (done == True):
			break
			
  
def findTurnAroundTime(processes, n, bt, wt, tat):
	
	# Calculating turnaround time 
	for i in range(n):
		tat[i] = bt[i] + wt[i] 

 
def findavgTime(processes, n, bt, quantum): 
	wt = [0] * n
	tat = [0] * n 
 
	findWaitingTime(processes, n, bt, wt, quantum) 
 
	findTurnAroundTime(processes, n, bt,wt, tat) 

 
	print("Processes Burst Time	 Waiting", "Time Turn-Around Time")
	total_wt = 0
	total_tat = 0
	for i in range(n):

		total_wt = total_wt + wt[i] 
		total_tat = total_tat + tat[i] 
		print(" ", i + 1, "\t\t", bt[i],"\t\t", wt[i], "\t\t", tat[i])

	print("\nAverage waiting time = %.5f "%(total_wt /n) )
	print("Average turn around time = %.5f "% (total_tat / n)) 
	
# Driver code 
if __name__ =="__main__":
	
	# Process id's 
	proc = [1, 2, 3]
	n = 3

	# Burst time of all processes 
	burst_time = [10, 5, 8] 

	# Time quantum 
	quantum = 2; 
	findavgTime(proc, n, burst_time, quantum)


 

Output:
Processes Burst Time	 Waiting Time Turn-Around Time
  1 		 10 		 13 		 23
  2 		 5 		 10 		 15
  3 		 8 		 13 		 21

Average waiting time = 12.00000 
Average turnaround time = 19.66667