Question

Using Python 3.5 or later, Write a function extractfromqueue (k, q) that takes the element k and the queue q as input parameters. The function searches for the element k in q, deletes it and returns True if found and returns False if the element k is not found in q. Any other element must remain on the queue respecting their order.

Answer 1

code:

class Queue:

#initialize empty queue

def __init__(self):

self.items = []

#checking is empty or not

def is_empty(self):

return self.items == []

#insert element in Queue

def enqueue(self, data):

self.items.append(data)

#dequeu operation

def dequeue(self):

return self.items.pop(0)

#extract from queue

def extractfromqueue(k,q):

index = -1

#getting index of the element we are extracting

for i in range(len(q.items)):

if q.items[i] == k:

index = i

break

#if item not found return false

if index == -1:

return False

else:

#removing value at that index and return true

q.items.pop(i)

return True

q = Queue()

q.enqueue(1)

q.enqueue(2)

q.enqueue(3)

print(q.items)

print(extractfromqueue(2,q))

print(q.items)

print(extractfromqueue(2,q))