"""simple docstring"""




from __future__ import annotations

from typing import Any

class    a_   :




					def __init__(						self    :  Union[str, Any]	,    snake_case__    :  int = 6  ):
							lowerCAmelCase__   = None
							lowerCAmelCase__   = None
							self.create_linked_list(snake_case__  )




					def     _SCREAMING_SNAKE_CASE    (						self    :  Tuple	,    snake_case__    :  int  ):
							lowerCAmelCase__   = Node()
							lowerCAmelCase__   = current_node
							lowerCAmelCase__   = current_node
							lowerCAmelCase__   = current_node
							for _ in range(1	,    snake_case__  ):
									lowerCAmelCase__   = Node()
									lowerCAmelCase__   = current_node
									lowerCAmelCase__   = previous_node
									lowerCAmelCase__   = current_node
							lowerCAmelCase__   = self.front
							lowerCAmelCase__   = previous_node




					def     _SCREAMING_SNAKE_CASE    (						self    :  Any  ):
							return (
							    self.front == self.rear
							    and self.front is not None
							    and self.front.data is None
							)




					def     _SCREAMING_SNAKE_CASE    (						self    :  Any  ):
							self.check_can_perform_operation()
							return self.front.data if self.front else None




					def     _SCREAMING_SNAKE_CASE    (						self    :  Dict	,    snake_case__    :  Any  ):
							if self.rear is None:
									return

							self.check_is_full()
							if not self.is_empty():
									lowerCAmelCase__   = self.rear.next
							if self.rear:
									lowerCAmelCase__   = data




					def     _SCREAMING_SNAKE_CASE    (						self    :  Any  ):
							self.check_can_perform_operation()
							if self.rear is None or self.front is None:
									return None
							if self.front == self.rear:
									lowerCAmelCase__   = self.front.data
									lowerCAmelCase__   = None
									return data

							lowerCAmelCase__   = self.front
							lowerCAmelCase__   = old_front.next
							lowerCAmelCase__   = old_front.data
							lowerCAmelCase__   = None
							return data




					def     _SCREAMING_SNAKE_CASE    (						self    :  Union[str, Any]  ):
							if self.is_empty():
									raise Exception("""Empty Queue"""  )




					def     _SCREAMING_SNAKE_CASE    (						self    :  Optional[Any]  ):
							if self.rear and self.rear.next == self.front:
									raise Exception("""Full Queue"""  )

class    a_   :




					def __init__(						self    :  Union[str, Any]  ):
							lowerCAmelCase__   = None
							lowerCAmelCase__   = None
							lowerCAmelCase__   = None


if __name__ == "__main__":
			import doctest

			doctest.testmod()





"""simple docstring"""




from __future__ import annotations

from statistics import mean







def 				_UpperCAmelCase		(							lowerCamelCase__      ,	lowerCamelCase__      ,	lowerCamelCase__  ):





		"""simple docstring"""




		lowerCAmelCase__   = [0] * no_of_processes
		lowerCAmelCase__   = [0] * no_of_processes

		# Initialize remaining_time to waiting_time.

		for i in range(lowerCamelCase__  ):
				lowerCAmelCase__   = burst_time[i]
		lowerCAmelCase__   = []

		lowerCAmelCase__   = 0
		lowerCAmelCase__   = 0

		# When processes are not completed,
		# A process whose arrival time has passed \
		# and has remaining execution time is put into the ready_process.
		# The shortest process in the ready_process, target_process is executed.

		while completed != no_of_processes:
				lowerCAmelCase__   = []
				lowerCAmelCase__   = -1

				for i in range(lowerCamelCase__  ):
						if (arrival_time[i] <= total_time) and (remaining_time[i] > 0):
								ready_process.append(lowerCamelCase__  )

				if len(lowerCamelCase__  ) > 0:
						lowerCAmelCase__   = ready_process[0]
						for i in ready_process:
								if remaining_time[i] < remaining_time[target_process]:
										lowerCAmelCase__   = i
						total_time += burst_time[target_process]
						completed += 1
						lowerCAmelCase__   = 0
						lowerCAmelCase__   = (
						    total_time - arrival_time[target_process] - burst_time[target_process]
						)
				else:
						total_time += 1

		return waiting_time







def 				_UpperCAmelCase		(							lowerCamelCase__      ,	lowerCamelCase__      ,	lowerCamelCase__  ):





		"""simple docstring"""




		lowerCAmelCase__   = [0] * no_of_processes
		for i in range(lowerCamelCase__  ):
				lowerCAmelCase__   = burst_time[i] + waiting_time[i]
		return turn_around_time


if __name__ == "__main__":
			print("[TEST CASE 01]")

			__lowerCAmelCase     :				str    				=    4
			__lowerCAmelCase     :				Dict    				=    [2, 5, 3, 7]
			__lowerCAmelCase     :				List[str]    				=    [0, 0, 0, 0]
			__lowerCAmelCase     :				Union[str, Any]    				=    calculate_waitingtime(arrival_time, burst_time, no_of_processes)
			__lowerCAmelCase     :				Union[str, Any]    				=    calculate_turnaroundtime(
			    burst_time, no_of_processes, waiting_time
			)

			# Printing the Result
			print("PID\tBurst Time\tArrival Time\tWaiting Time\tTurnaround Time")
			for i, process_id in enumerate(list(range(1, 5))):
						print(
						    F"{process_id}\t{burst_time[i]}\t\t\t{arrival_time[i]}\t\t\t\t"
						    F"{waiting_time[i]}\t\t\t\t{turn_around_time[i]}"
						)
			print(F"\nAverage waiting time = {mean(waiting_time):.5f}")
			print(F"Average turnaround time = {mean(turn_around_time):.5f}")




