SKELETON CODE

Exercise 1: Complete the Bounded and Circular Queue Class Definitions, and Test 1. Download and save queues.py from eClass. This file contains partial implementations for the Bounded Queue and the Circular Queue, as discussed in the lectures. enqueue (item) - Complete this method for both types of queues. You may refer directly to the lecture slides on eClass. de queue () - Complete this method for both types of queues. You may refer directly to the lecture slides on eClass. 2. Test your Bounded Queue and Circular Queue classes (especially the methods you have just written). To get you started, queues.py contains the skeleton code for a number of tests to check various aspects of the Bounded Queue's implementation. Uncomment and run/write the code for each test, one at a time, to check that you get the same sample output as below. Test 1: Complete the try statement. If the Bounded Queue's dequeue() method is correct, an exception should be raised when you attempt to dequeue from the empty queue, bq. Handle it by printing out the argument of the exception. Change the argument string in the Bounded Queue's dequeue() definition and rerun this test is the new message displayed on the screen now? Test 2: Test the Bounded Queue's enqueue() method by trying to add 'bob' to bq. When printing the contents of bq to the screen, are print (bq) and print (str (bq)) the same? Does the method isEmpty() return the expected result? Test 3: Run given code. When multiple items are added to the queue, does the queue store them in the correct order (test the repr function)? Do the isFullo and size methods give the expected results? Test 4: Write a try statement to attempt to add an item to the full bq. If the Bounded Queue's enqueue() method is correct, it should raise an exception. Handle that exception in the main() by printing out the exception's argument. Test 5: Run given code. Can an item be removed from a full bounded queue? Does the dequeue() method return the expected item, and are the contents of bq updated? Test 6: Run given code. Test the capacity() method. How is capacity different from size? Test 7: Try to access the private capacity attribute outside of the Bounded Queue class definition (i.e. in the main). What happens? Does the same thing happen if you try to access a non-private attribute outside of its class definition? Sample Output: My bounded queue is: Max=3 Is my bounded queue empty? True Try to dequeue an empty bounded queue... Error: Queue is empty bob bob Is my bounded queue empty? False - - - - - - - - - - - bob eva paul Max=3 Is my bounded queue full? True There are 3 elements in my bounded queue. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Try to enqueue a full bounded queue... Error: Queue is full ---------------------------------- eva paul Max=3 bob was first in the bounded queue: eva paul There are 2 elements in my bounded queue. - - - - - - - - - - - - - - - - - - - - - Total capacity is: 3 class BoundedQueue: # Creates a new empty queue: def _init__(self, capacity): assert isinstance (capacity, int), ('Error: Type error: %s' f (type (capac assert capacity >= 0, ('Error: Illegal capacity: %d' % (capacity)) self.__items = [] # init the list / queue as empty self.__capacity = capacity # Adds a new item to the back of the queue, and returns nothing: def enqueue (self, item): Enqueue the element to the back of the queue :param item: the element to be enqueued :return: No returns ### ## START CODE HERE ##### Remember to check the conditions pass ## ### END CODE HERE ### ### # Removes and returns the front-most item in the queue. # Returns nothing if the queue is empty. def dequeue (self): Dequeue the element from the front of the queue and return it :return: The object that was dequeued ### ## START CODE HERE ### ## 1. remember to check the conditions 2. return the appropriate value pass ### ## END CODE HERE ## # # # # # Returns the front-most item in the queue, and DOES NOT change the queue. def peek (self): if len (self._items) = 0, ('Error: Illegal capacity: %d' % (capacity)) # Initialize private attributes self.__items = [] self._capacity = capacity self._count=0 self._head=0 self._tail=0 # Allocate space for the circular queue for i in range (self._capacity): self._items.append (None) # Adds a new item to the back of the queue, and returns nothing: def enqueue (self, item): This function enqueues the item into the back of the queue :param item: The item to be queued :return: No returns ##### START CODE HERE ### ## Remember to check the proper conditions pass ### ## END CODE HERE ## ## ## # Removes and returns the front-most item in the queue. # Returns nothing if the queue is empty. def dequeue (self): Dequeue the the element from the front of the queue and return the value :return: Returns the object that is dequeued ### ## START CODE HERE ##### Remember to check the proper conditions (some hints) 1. get item at the head of queue 2. remove the item from the head of queue 3. decrease stored size of queue 4. Shift the head 5. return the item pass ##### END CODE HERE ###### # Returns the front-most item in the queue, and DOES NOT change the queue. def peek (self): if self.__count == 0: raise Exception ('Error: Queue is empty') return self._items[self._head] # Returns True if the queue is empty, and False otherwise: def is_empty (self): return self._count == 0 # Returns True if the queue is full, and False otherwise: def is_full (self): return self.__count == self._capacity # Returns the number of items in the queue: def size (self): return self._count # Returns the capacity of the queue: def capacity (self): return self._capacity # Removes all items from the queue, and sets the size to o # clear() should not change the capacity def clear(self): self.__items = [] self.__count = 0 self._head = 0 Sell. Lall = U # Returns a string representation of the queue: def _str_(self): str_exp = "]" i = self.__head for j in range (self._count): str_exp+= str(self._items[i]) + "" i = (i+1) % self._capacity return str_exp + "]" # Returns a string representation of the object CircularQueue def repr_ (self): return str(self._items) + " H= " + str(self._head) + " T="+str(self._tail) + " (" +str(self._count)+"/"+str(self._capacity) +")" def main(): # Test bounded queue creation bq=BoundedQueue (3) print ("My bounded queue is:", bq) print (repr (bq)) print("Is my bounded queue empty?", bq.isEmpty()) ---') print(