Question

PYTHON please help this is very confusing! THANK YOU!
Q5 18 Points In this question, we will implement the DrippingStack class. This is a fixed capacity stack; it's size does not increase or decrease automatically. Capacity of this DrippingStack will be determined during initialization. When push is invoked with the DrippingStack at full capacity, rather than throwing a FullStack exception, a more typical semantic is to accept the pushed element at the top while dripping the oldest element from the bottom of the DrippingStack to make room. Give an implementation of such a DrippingStack abstraction, using a circular array (Important!) with appropriate storage capacity. The operations from the DrippingStack ADT are: _init_(self, capacity): initialize the DrippingStack object which has a fixed capacity (capacity will be determined by capacity parameter) _len_(self): returns the number of elements in the DrippingStack. is_empty(self); returns True if and only if the DrippingStack is empty.se push(self,e): adds new element e to the DrippingStack (LIFO ordering), if DrippingStack is not full. If it's full, it discards/drips the oldest element from the bottom and adds new elemente at the top of the DrippingStack. pop(self): removes and returns the element from the DrippingStack. (LIFO ordering). If DrippingStack is empty, throws Empty Stack Exception. top(self): returns the element at top of the DrippingStack without removing it from the DrippingStack (LIFO ordering). If DrippingStack is empty, throws Empty Stack Exception. For example, your implementation should provide the following behavior: un $1 = DrippingStack(5) s1.push(49313 s1.push(5)

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. If not, PLEASE let me know before you rate, I’ll help you fix whatever issues. Thanks

Note: Please maintain proper code spacing (indentation), just copy the code part and paste it in your compiler/IDE directly, no modifications required.

#code

from queue import Empty


# DrippingStack class
class DrippingStack:
    # constructor
    def __init__(self, capacity):
        # ensuring that capacity is valid
        assert capacity > 0
        # creating a fixed array (list) of capacity number of elements
        self.__array = [None] * capacity
        # setting 0 as bottom index as well as the count
        self.__bottom = 0
        self.__count = 0

    def push(self, item):
        # adding count to bottom and wrapping around if necessary to get the index of next position
        # to add new value
        index = (self.__bottom + self.__count) % len(self.__array)
        # adding item to index position. if the array is full, the oldest element will be automatically
        # overwritten by new item
        self.__array[index] = item
        # checking if array is currently full (before adding new element)
        if self.__count == len(self.__array):
            # advancing bottom index, and wrapping around if necessary
            self.__bottom = (self.__bottom + 1) % len(self.__array)
        # otherwise incrementing count
        else:
            self.__count += 1

    def pop(self):
        # if empty, throwing exception
        if self.__count == 0:
            raise Empty()
        # otherwise finding index of top element by adding count-1 to bottom, ( wrapping around if necessary)
        index = (self.__bottom + self.__count - 1) % len(self.__array)
        # storing value
        value = self.__array[index]
        # changing value to None
        self.__array[index] = None
        # decrementing count
        self.__count -= 1
        # returning value
        return value

    def top(self):
        if self.__count == 0:
            raise Empty()
        # finding index of top element by adding count-1 to bottom, ( wrapping around if necessary)
        index = (self.__bottom + self.__count - 1) % len(self.__array)
        # returning value at index, without removing
        return self.__array[index]

    def is_empty(self):
        return self.__count == 0

    def __len__(self):
        return self.__count


# end of DrippingStack class


# code for testing, remove if not needed
s1 = DrippingStack(5)
s1.push(4)
s1.push(5)
s1.push(10)
s1.push(15)
print(s1.pop())  # 15
s1.push(200)
s1.push(500)
s1.push(19)
print(len(s1))  # 5
print(s1.pop())  # 19

#output

15

5

19