Please post your solutions to the Sep 15 In-Class Exercise to this thread.

Best,

Chris

class Queue(object):

def __init__(self):
    self.queue = []
def enqueue(self, object):
    self.queue.append(object)
def dequeue(self):
    return self.queue.pop(0)
@property
def length(self):
    return len(self.queue) 

q = Queue() q.enqueue(1) q.enqueue(2) q.enqueue(3)

q.length # 3 q.dequeue()# 1 q.dequeue() # 2 issubclass(Queue,object) # True isinstance(q,Queue) # True

Output:

class Queue(object): def init(self) : self.queue = []; def push(self, object): self.queue.append(object); def pop(self): self.queue.pop(0); def length(self): return len(self.queue)

my_instance = Queue()

my_instance.push(1)

my_instance.push(2)

my_instance.push(3)

my_instance.length()

my_instance.pop()

my_instance.length()

class Queue:

def __init__(self):

    self.itemss = []

def isEmpty(self):
    return self.itemss == []

def size(self):
    # size of the list
    return len(self.itemss)

def enqueue(self, itemx):
    self.itemss.insert(0, itemx)

def dequeue(self):
    # removes  an  item from the queue
    return self.itemss.pop(-1)

if name == 'main': queue = Queue() queue.enqueue(4) queue.enqueue(1) queue.enqueue(456) print(queue.dequeue()) print(queue.dequeue()) print(queue.dequeue())

After popping we get 4 then 1 then 456 in that FIFO.

class Queue: def init(self): self.queue = []

def isEmpty(self):
	return len(self.queue) == 0

def add(self, data):
	self.queue.append(data)

def remove(self):
	return self.queue.pop(0);

def size(self):
	return len(self.queue)

if name=='main':

queue = Queue()
print("Is queue empty?" , queue.isEmpty())

queue.add(8)
queue.add(5)
queue.add(11)

print("Size of queue is", queue.size())

print("Removing element from queue: ", queue.remove())

print("Size of queue is", queue.size())

'''Output:'''

Is queue empty? True

Size of queue is 3

Removing element from queue: 8

Size of queue is 2

>>> class queue(object):

def __init__(self):
    self.queue=[]
def push(self, object):
    self.queue.append(object)
def pop(self):
    return self.queue.pop(0)
def length(self):
    return len(self.queue)

>>> inst=queue()

>>> inst.push("hey")

>>> print(inst.length())

1

>>> inst.push("hello")

>>> print(inst.pop())

hey

class myqueue: def init(self) -> None: self.queue = []

def enqueue(self,item):
    self.queue.append(item)

def dequeue(self) -> int:
    return self.queue.pop(0)

def length(self)->int:
    return len(self.queue)

myq = myqueue()

myq.enqueue(1)

myq.enqueue(2)

myq.enqueue(8)

print("removed :")

print(myq.dequeue())

print("removed :")

print(myq.dequeue())

print("removed :")

print(myq.dequeue())