A queue is a collection of items supportng three operations: – enqueue (item): a
ID: 3683408 • Letter: A
Question
A queue is a collection of items supportng three operations: – enqueue (item): add item to the “front” of the queue – dequeue(): removes the “last” item from the queue (the one that’s been in the queue the longest) and returns it – empty(): returns True if the stack is empty, else False Note: stacks are “LIFO” (last-in-first-out), queues are “FIFO” (first-in-first-out) Implement and test Queue class. Submit to dropbox: .py file containing Queue class and a funcGon testQueue() that demonstrates use of the class. (Use python)
Explanation / Answer
class Queue:
def __init__(self):
self.items = []
def isEmpty(self):
return self.items == []
def enqueue(self, item):
self.items.insert(0,item)
def dequeue(self):
return self.items.pop()
def size(self):
return len(self.items)
testing queue:
import Queue
q = Queue.Queue()
for i in range(5):
print q.enqueue(i)
while not q.empty():
print q.dequeue()