Ch07 Lab - 큐

Code07-01.py

큐의 기본 개념: 데이터를 enqueue합니다

queue = [None, None, None, None, None]
front = rear = -1

rear += 1
queue[rear] = "화사"
rear += 1
queue[rear] = "솔라"
rear += 1
queue[rear] = "문별"

print("----- 큐 상태 -----")
print ( '[출구] <-- ', end='')
for i in range(0, len(queue), 1) :
	print(queue[i], end=' ')
print ( '<-- [입구] ')

Code07-01.py

Queue basics: enqueue data

queue = [None, None, None, None, None]
front = rear = -1

rear += 1
queue[rear] = "Hwasa"
rear += 1
queue[rear] = "Solar"
rear += 1
queue[rear] = "Moonbyul"

print("----- Queue Status -----")
print ( '[Exit] <-- ', end='')
for i in range(0, len(queue), 1) :
	print(queue[i], end=' ')
print ( '<-- [Entrance] ')

Code07-02.py

큐의 기본 개념: 데이터를 dequeue합니다

queue = ["화사", "솔라", "문별", None, None]
front = -1
rear = 2

print("----- 큐 상태 -----")
print ( '[출구] <-- ', end = ' ')
for i in range(0, len(queue), 1) :
	print(queue[i], end = ' ')
print ( '<-- [입구] ')
print("-------------------")

front += 1
data = queue[front]
queue[front] = None
print('deQueue --> ', data)

front += 1
data = queue[front]
queue[front] = None
print('deQueue --> ', data)

front += 1
data = queue[front]
queue[front] = None
print('deQueue --> ', data)
print("-------------------")

print("----- 큐 상태 -----")
print ( '[출구] <-- ', end = '')
for i in range(0, len(queue), 1) :
	print(queue[i], end = ' ')
print ( '<-- [입구] ')

Code07-02.py

Queue basics: dequeue data

queue = ["Hwasa", "Solar", "Moonbyul", None, None]
front = -1
rear = 2

print("----- Queue Status -----")
print ( '[Exit] <-- ', end = ' ')
for i in range(0, len(queue), 1) :
	print(queue[i], end = ' ')
print ( '<-- [Entrance] ')
print("-------------------")

front += 1
data = queue[front]
queue[front] = None
print('deQueue --> ', data)

front += 1
data = queue[front]
queue[front] = None
print('deQueue --> ', data)

front += 1
data = queue[front]
queue[front] = None
print('deQueue --> ', data)
print("-------------------")

print("----- Queue Status -----")
print ( '[Exit] <-- ', end = '')
for i in range(0, len(queue), 1) :
	print(queue[i], end = ' ')
print ( '<-- [Entrance] ')

Code07-03.py

큐 Full 상태를 확인하는 함수를 구현합니다

def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

SIZE = 5
queue = ["화사", "솔라", "문별", "휘인", "선미"]
front = -1
rear = 4

print("큐가 꽉 찼는지 여부 ==>", isQueueFull())

Code07-03.py

Implements a function to check if the queue is full

def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

SIZE = 5
queue = ["Hwasa", "Solar", "Moonbyul", "Wheein", "Sunmi"]
front = -1
rear = 4

print("Whether the queue is full ==>", isQueueFull())

Code07-04.py

큐 Full 확인 후 데이터를 enqueue합니다

def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("큐가 꽉 찼습니다.")
		return
	rear += 1
	queue[rear] = data

SIZE = 5
queue = ["화사", "솔라", "문별", "휘인", None]
front = -1
rear = 3

print(queue)
enQueue("선미")
print(queue)
enQueue("재남")

Code07-04.py

Enqueues data after checking if the queue is full

def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("Queue is full.")
		return
	rear += 1
	queue[rear] = data

SIZE = 5
queue = ["Hwasa", "Solar", "Moonbyul", "Wheein", None]
front = -1
rear = 3

print(queue)
enQueue("Sunmi")
print(queue)
enQueue("Jaenam")

Code07-05.py

큐 Empty 상태를 확인하는 함수를 구현합니다

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

SIZE = 5
queue = [ None for _ in range(SIZE) ]
front = rear = -1

print("큐가 비었는지 여부 ==>", isQueueEmpty())

Code07-05.py

Implements a function to check if the queue is empty

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

SIZE = 5
queue = [ None for _ in range(SIZE) ]
front = rear = -1

print("Whether the queue is empty ==>", isQueueEmpty())

Code07-06.py

큐 Empty 확인 후 데이터를 dequeue합니다

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None
	return data

SIZE = 5
queue = ["화사", None, None, None, None]
front = -1
rear = 0

print(queue)
retData = deQueue()
print("추출한 데이터 -->", retData)
print(queue)
retData = deQueue()

Code07-06.py

Dequeues data after checking if the queue is empty

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None
	return data

SIZE = 5
queue = ["Hwasa", None, None, None, None]
front = -1
rear = 0

print(queue)
retData = deQueue()
print("Extracted data -->", retData)
print(queue)
retData = deQueue()

Code07-07.py

큐의 front 데이터를 확인하는 peek 함수를 구현합니다

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	return queue[front+1]

SIZE = 5
queue = ["화사", "솔라", "문별", None, None]
front = -1
rear = 2

print(queue)
retData = peek()
print("다음에 추출될 데이터 확인 -->", retData)
print(queue)

Code07-07.py

Implements a peek function to check the front of the queue

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	return queue[front+1]

SIZE = 5
queue = ["Hwasa", "Solar", "Moonbyul", None, None]
front = -1
rear = 2

print(queue)
retData = peek()
print("Check next data to be extracted -->", retData)
print(queue)

Code07-08.py

큐의 enqueue/dequeue/peek 통합 프로그램입니다

## 함수 선언 부분 ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("큐가 꽉 찼습니다.")
		return
	rear += 1
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	return queue[front+1]

## 전역 변수 선언 부분 ##
SIZE = int(input("큐의 크기를 입력하세요 ==> "))
queue = [ None for _ in range(SIZE) ]
front = rear = -1

## 메인 코드 부분 ##

if __name__ == "__main__" :
	select = input("삽입(I)/추출(E)/확인(V)/종료(X) 중 하나를 선택 ==> ")

	while (select != 'X' and select != 'x') :
		if select=='I' or select =='i' :
			data = input("입력할 데이터 ==> ")
			enQueue(data)
			print("큐 상태 : ", queue)
		elif select=='E' or select =='e' :
			data = deQueue()
			print("추출된 데이터 ==> ", data)
			print("큐 상태 : ", queue)
		elif select=='V' or select =='v' :
			data = peek()
			print("확인된 데이터 ==> ", data)
			print("큐 상태 : ", queue)
		else :
			print("입력이 잘못됨")

		select = input("삽입(I)/추출(E)/확인(V)/종료(X) 중 하나를 선택 ==> ")

	print("프로그램 종료!")

Code07-08.py

Complete queue program with enqueue, dequeue, and peek

## Function Declarations ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("Queue is full.")
		return
	rear += 1
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	return queue[front+1]

## Global Variables ##
SIZE = int(input("Enter the queue size ==> "))
queue = [ None for _ in range(SIZE) ]
front = rear = -1

## Main Code ##
if __name__ == "__main__" :
	select = input("Choose: Insert(I)/Extract(E)/Check(V)/Quit(X) ==> ")

	while (select != 'X' and select != 'x') :
		if select=='I' or select =='i' :
			data = input("Data to input ==> ")
			enQueue(data)
			print("Queue status: ", queue)
		elif select=='E' or select =='e' :
			data = deQueue()
			print("Extracted data ==> ", data)
			print("Queue status: ", queue)
		elif select=='V' or select =='v' :
			data = peek()
			print("Checked data ==> ", data)
			print("Queue status: ", queue)
		else :
			print("Invalid input")

		select = input("Choose: Insert(I)/Extract(E)/Check(V)/Quit(X) ==> ")

	print("Program terminated!")

Code07-09.py

큐의 데이터 이동 방식을 개선합니다 (자리이동 큐)

def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear != SIZE-1) :
		return False
	elif (rear == SIZE -1) and (front == -1) :
		return True
	else :
		for i in range(front+1, SIZE) :
			queue[i-1] = queue[i]
			queue[i] = None
		front -= 1
		rear -= 1
		return False

SIZE = 5
queue = [None, None, "문별", "휘인", "선미"]
front = 1
rear = 4

print("큐가 꽉 찼는지 여부 ==>", isQueueFull())
print("큐 상태 ==> ", queue)

Code07-09.py

Improves queue by shifting data forward (shifting queue)

def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear != SIZE-1) :
		return False
	elif (rear == SIZE -1) and (front == -1) :
		return True
	else :
		for i in range(front+1, SIZE) :
			queue[i-1] = queue[i]
			queue[i] = None
		front -= 1
		rear -= 1
		return False

SIZE = 5
queue = [None, None, "Moonbyul", "Wheein", "Sunmi"]
front = 1
rear = 4

print("Whether the queue is full ==>", isQueueFull())
print("Queue status ==> ", queue)

Code07-10.py

자리이동 큐의 통합 프로그램입니다

## 함수 선언 부분 ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear != SIZE-1) :
		return False
	elif (rear == SIZE -1) and (front == -1) :
		return True
	else :
		for i in range(front+1, SIZE) :
			queue[i-1] = queue[i]
			queue[i] = None
		front -= 1
		rear -= 1
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("큐가 꽉 찼습니다.")
		return
	rear += 1
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	return queue[front+1]

## 전역 변수 선언 부분 ##
SIZE = int(input("큐의 크기를 입력하세요 ==> "))
queue = [ None for _ in range(SIZE) ]
front = rear = -1

## 메인 코드 부분 ##

if __name__ == "__main__" :
	select = input("삽입(I)/추출(E)/확인(V)/종료(X) 중 하나 선택 ==> ")

	while (select != 'X' and select != 'x') :
		if select=='I' or select =='i' :
			data = input("입력할 데이터 ==> ")
			enQueue(data)
			print("큐 상태 : ", queue)
		elif select=='E' or select =='e' :
			data = deQueue()
			print("추출된 데이터 ==> ", data)
			print("큐 상태 : ", queue)
		elif select=='V' or select =='v' :
			data = peek()
			print("확인된 데이터 ==> ", data)
			print("큐 상태 : ", queue)
		else :
			print("입력이 잘못됨")

		select = input("삽입(I)/추출(E)/확인(V)/종료(X) 중 하나 선택 ==> ")

	print("프로그램 종료!")

Code07-10.py

Complete shifting queue program

## Function Declarations ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear != SIZE-1) :
		return False
	elif (rear == SIZE -1) and (front == -1) :
		return True
	else :
		for i in range(front+1, SIZE) :
			queue[i-1] = queue[i]
			queue[i] = None
		front -= 1
		rear -= 1
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("Queue is full.")
		return
	rear += 1
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	return queue[front+1]

## Global Variables ##
SIZE = int(input("Enter the queue size ==> "))
queue = [ None for _ in range(SIZE) ]
front = rear = -1

## Main Code ##
if __name__ == "__main__" :
	select = input("Choose: Insert(I)/Extract(E)/Check(V)/Quit(X) ==> ")

	while (select != 'X' and select != 'x') :
		if select=='I' or select =='i' :
			data = input("Data to input ==> ")
			enQueue(data)
			print("Queue status: ", queue)
		elif select=='E' or select =='e' :
			data = deQueue()
			print("Extracted data ==> ", data)
			print("Queue status: ", queue)
		elif select=='V' or select =='v' :
			data = peek()
			print("Checked data ==> ", data)
			print("Queue status: ", queue)
		else :
			print("Invalid input")

		select = input("Choose: Insert(I)/Extract(E)/Check(V)/Quit(X) ==> ")

	print("Program terminated!")

Code07-11.py

원형 큐를 구현합니다 (모듈러 연산 활용)

## 함수 선언 부분 ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if ( (rear + 1) % SIZE == front) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("큐가 꽉 찼습니다.")
		return
	rear = (rear + 1) % SIZE
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	front = (front + 1) % SIZE
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	return queue[(front + 1) % SIZE]

## 전역 변수 선언 부분 ##
SIZE = int(input("큐의 크기를 입력하세요 ==> "))
queue = [ None for _ in range(SIZE) ]
front = rear = 0

## 메인 코드 부분 ##

if __name__ == "__main__" :
	select = input("삽입(I)/추출(E)/확인(V)/종료(X) 중 하나를 선택 ==> ")

	while (select != 'X' and select != 'x') :
		if select=='I' or select =='i' :
			data = input("입력할 데이터 ==> ")
			enQueue(data)
			print("큐 상태 : ", queue)
			print("front : ", front, ", rear : ", rear)
		elif select=='E' or select =='e' :
			data = deQueue()
			print("추출된 데이터 ==> ", data)
			print("큐 상태 : ", queue)
			print("front : ", front, ", rear : ", rear)
		elif select=='V' or select =='v' :
			data = peek()
			print("확인된 데이터 ==> ", data)
			print("큐 상태 : ", queue)
			print("front : ", front, ", rear : ", rear)
		else :
			print("입력이 잘못됨")

		select = input("삽입(I)/추출(E)/확인(V)/종료(X) 중 하나를 선택 ==> ")

	print("프로그램 종료!")

Code07-11.py

Implements a circular queue using modular arithmetic

## Function Declarations ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if ( (rear + 1) % SIZE == front) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("Queue is full.")
		return
	rear = (rear + 1) % SIZE
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	front = (front + 1) % SIZE
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	return queue[(front + 1) % SIZE]

## Global Variables ##
SIZE = int(input("Enter the queue size ==> "))
queue = [ None for _ in range(SIZE) ]
front = rear = 0

## Main Code ##
if __name__ == "__main__" :
	select = input("Choose: Insert(I)/Extract(E)/Check(V)/Quit(X) ==> ")

	while (select != 'X' and select != 'x') :
		if select=='I' or select =='i' :
			data = input("Data to input ==> ")
			enQueue(data)
			print("Queue status: ", queue)
			print("front : ", front, ", rear : ", rear)
		elif select=='E' or select =='e' :
			data = deQueue()
			print("Extracted data ==> ", data)
			print("Queue status: ", queue)
			print("front : ", front, ", rear : ", rear)
		elif select=='V' or select =='v' :
			data = peek()
			print("Checked data ==> ", data)
			print("Queue status: ", queue)
			print("front : ", front, ", rear : ", rear)
		else :
			print("Invalid input")

		select = input("Choose: Insert(I)/Extract(E)/Check(V)/Quit(X) ==> ")

	print("Program terminated!")

Ex07-01.py

큐 응용: 콜센터 대기열 시뮬레이션

## 함수 선언 부분 ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("큐가 꽉 찼습니다.")
		return
	rear += 1
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None

	for i in range(front + 1, rear + 1): 	# 모든 사람을 한칸씩 앞으로 당긴다.
		queue[i - 1] = queue[i]
		queue[i] = None
	front = -1
	rear -= 1

	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	return queue[front+1]

## 전역 변수 선언 부분 ##
SIZE = 5
queue = [ None for _ in range(SIZE) ]
front = rear = -1

## 메인 코드 부분 ##

if __name__ == "__main__" :
	enQueue('정국')
	enQueue('뷔')
	enQueue('지민')
	enQueue('진')
	enQueue('슈가')
	print("대기 줄 상태 : ", queue)

	for _ in range(rear+1) :
		print(deQueue(), '님 식당에 들어감')
		print("대기 줄 상태 : ", queue)

	print("식당 영업 종료!")

Ex07-01.py

Queue application: call center waiting queue simulation

## Function Declarations ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if (rear == SIZE-1) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("Queue is full.")
		return
	rear += 1
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	front += 1
	data = queue[front]
	queue[front] = None

	for i in range(front + 1, rear + 1): 	# Shift everyone one position forward.
		queue[i - 1] = queue[i]
		queue[i] = None
	front = -1
	rear -= 1

	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	return queue[front+1]

## Global Variables ##
SIZE = 5
queue = [ None for _ in range(SIZE) ]
front = rear = -1

## Main Code ##
if __name__ == "__main__" :
	enQueue('Jungkook')
	enQueue('V')
	enQueue('Jimin')
	enQueue('Jin')
	enQueue('Suga')
	print("Waiting line status: ", queue)

	for _ in range(rear+1) :
		print(deQueue(), ' enters the restaurant')
		print("Waiting line status: ", queue)

	print("Restaurant closed!")

Ex07-02.py

원형 큐 응용: 핫도그 가게 시뮬레이션

## 함수 선언 부분 ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if ( (rear + 1) % SIZE == front) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("큐가 꽉 찼습니다.")
		return
	rear = (rear + 1) % SIZE
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	front = (front + 1) % SIZE
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("큐가 비었습니다.")
		return None
	return queue[(front + 1) % SIZE]

def calcTime() :

	global SIZE, queue, front, rear
	timeSum = 0
	for i in range((front+1)% SIZE, (rear+1)%SIZE) :
		timeSum += queue[i][1]
	return timeSum

## 전역 변수 선언 부분 ##
SIZE = 6
queue = [ None for _ in range(SIZE) ]
front = rear = 0

## 메인 코드 부분 ##

if __name__ == "__main__" :
	waitCall = [('사용', 9), ('고장', 3), ('환불', 4), ('환불', 4), ('고장', 3)]

	for call in waitCall :
		print("귀하의 대기 예상시간은 ", calcTime(), "분입니다.")
		print("현재 대기 콜 --> ", queue)
		enQueue(call)
		print()

	print("최종 대기 콜 --> ", queue)
	print("프로그램 종료!")

Ex07-02.py

Circular queue application: hot dog stand simulation

## Function Declarations ##
def isQueueFull() :

	global SIZE, queue, front, rear
	if ( (rear + 1) % SIZE == front) :
		return True
	else :
		return False

def isQueueEmpty() :

	global SIZE, queue, front, rear
	if (front == rear) :
		return True
	else :
		return False

def enQueue(data) :

	global SIZE, queue, front, rear
	if (isQueueFull()) :
		print("Queue is full.")
		return
	rear = (rear + 1) % SIZE
	queue[rear] = data

def deQueue() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	front = (front + 1) % SIZE
	data = queue[front]
	queue[front] = None
	return data

def peek() :

	global SIZE, queue, front, rear
	if (isQueueEmpty()) :
		print("Queue is empty.")
		return None
	return queue[(front + 1) % SIZE]

def calcTime() :

	global SIZE, queue, front, rear
	timeSum = 0
	for i in range((front+1)% SIZE, (rear+1)%SIZE) :
		timeSum += queue[i][1]
	return timeSum

## Global Variables ##
SIZE = 6
queue = [ None for _ in range(SIZE) ]
front = rear = 0

## Main Code ##
if __name__ == "__main__" :
	waitCall = [('in use', 9), ('broken', 3), ('Refund', 4), ('Refund', 4), ('broken', 3)]

	for call in waitCall :
		print("Your estimated wait time is ", calcTime(), "minutes.")
		print("Current waiting call --> ", queue)
		enQueue(call)
		print()

	print("Final waiting call --> ", queue)
	print("Program terminated!")

Self07-01.py

enQueue 함수를 직접 구현합니다

def enQueue(data) :

    global SIZE, queue, front, rear
    if (rear == SIZE-1) :
        print("큐가 꽉 찼습니다.")
        return
    rear += 1
    queue[rear] = data

SIZE = 5
queue = ["화사", "솔라", "문별", "휘인", None]
front = -1
rear = 3

print(queue)
enQueue("선미")
print(queue)
enQueue("재남")

Self07-01.py

Implements the enQueue function yourself

def enQueue(data) :

    global SIZE, queue, front, rear
    if (rear == SIZE-1) :
        print("Queue is full.")
        return
    rear += 1
    queue[rear] = data

SIZE = 5
queue = ["Hwasa", "Solar", "Moonbyul", "Wheein", None]
front = -1
rear = 3

print(queue)
enQueue("Sunmi")
print(queue)
enQueue("Jaenam")

Self07-02.py

deQueue 함수를 직접 구현합니다

def deQueue() :

    global SIZE, queue, front, rear
    if (front == rear) :
        print("큐가 비었습니다.")
        return None
    front += 1
    data = queue[front]
    queue[front] = None
    return data

SIZE = 5
queue = ["화사", None, None, None, None]
front = -1
rear = 0

print(queue)
retData = deQueue()
print("추출한 데이터 -->", retData)
print(queue)
retData = deQueue()

Self07-02.py

Implements the deQueue function yourself

def deQueue() :

    global SIZE, queue, front, rear
    if (front == rear) :
        print("Queue is empty.")
        return None
    front += 1
    data = queue[front]
    queue[front] = None
    return data

SIZE = 5
queue = ["Hwasa", None, None, None, None]
front = -1
rear = 0

print(queue)
retData = deQueue()
print("Extracted data -->", retData)
print(queue)
retData = deQueue()

🧪 Ch07. 큐 — 실습 코드 / Lab Code: Queues

📘 교재 예제 (Code)

📘 Textbook Examples (Code)

📗 응용 예제 (Ex)

📗 Applied Examples (Ex)

📙 자가 실습 (Self)

📙 Self Practice (Self)