2.When you send a file to be printed on a shared printer, it is put onto a print queue with other jobs. Anytime before your job prints, you can access the queue to remove it. Thus, some queues support a remove operation. Add this method to the queue implementations. The method should expect an integer index as an argument. It should then remove and return the item in the queue at that position (counting from position 0 at the front to position n –1 at the rear). Use this Python template: class Queue: ''' TODO: Remove the "pass" statements and implement each method Add any methods if necesssary DON'T use any builtin queue class to store your items ''' def __init__(self): # Constructor function pass def isEmpty(self): # Returns True if the queue is empty or False otherwise pass def len(self): # Returns the number of items in the queue pass def peek(self): # Returns the item at the front of the queue pass def add(self, item): # Adds item to the rear of the queue pass def pop(self): # Removes and returns the item at the front of the queue pass def remove(self, index): # Removes and returns the item at index of the queue pass if __name__ == "__main__": queue = Queue() #TODO (optional): Your testing code here
2.When you send a file to be printed on a shared printer, it is put onto a print
queue with other jobs. Anytime before your job prints, you can access the queue
to remove it. Thus, some queues support a remove operation. Add this method to
the queue implementations. The method should expect an integer index as an
argument. It should then remove and return the item in the queue at that position
(counting from position 0 at the front to position n –1 at the rear).
Use this Python template:
class Queue:
'''
TODO: Remove the "pass" statements and implement each method
Add any methods if necesssary
DON'T use any builtin queue class to store your items
'''
def __init__(self): # Constructor function
pass
def isEmpty(self): # Returns True if the queue is empty or False otherwise
pass
def len(self): # Returns the number of items in the queue
pass
def peek(self): # Returns the item at the front of the queue
pass
def add(self, item): # Adds item to the rear of the queue
pass
def pop(self): # Removes and returns the item at the front of the queue
pass
def remove(self, index): # Removes and returns the item at index of the queue
pass
if __name__ == "__main__":
queue = Queue()
#TODO (optional): Your testing code here
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
