Exercises - Reinforcement completed.

Author: MayankShah1

.idea/workspace.xml

@@ -0,0 +1,24 @@
+import stackarray as Stack
+
+def transfer(S, T):
+    """Transfer the contents of stack of S to stack T"""
+
+    while not S.is_empty():
+        T.push(S.pop())
+
+
+# Testing
+if __name__ == "__main__":
+    S = Stack.ArrayStack()
+    T = Stack.ArrayStack()
+
+    S.push(12)
+    S.push(10)
+    S.push(25)
+    print(S)
+    print(T)
+    transfer(S,T)
+    print(T)
+
+
+

06-Stacks-Queues-Deques/Exercises/Reinforcement/R6-03.py

@@ -0,0 +1,21 @@
+import stackarray as Stack
+
+def empty_stack(S):
+    """Empty the stack"""
+
+    if S.is_empty():
+        return
+    else:
+        print('Item popped: ',S.pop())
+        empty_stack(S)
+
+
+# Testing
+if __name__ == "__main__":
+    S = Stack.ArrayStack()
+    S.push(12)
+    S.push(10)
+    S.push(25)
+    print(S)
+    empty_stack(S)
+    print("Length of stack S: ",len(S))

06-Stacks-Queues-Deques/Exercises/Reinforcement/R6-04.py

@@ -0,0 +1,17 @@
+import stackarray as Stack
+
+def reverse_list(data):
+    """Reverse the elements of list using stack"""
+
+    S = Stack.ArrayStack()
+    for i in range(len(data)):
+        S.push(data[i])
+    for i in range(len(data)):
+        data[i] = S.pop()
+
+# Testing
+if __name__ == "__main__":
+    data_set = [1,2,3,4,5,6,7]
+    print(data_set)
+    reverse_list(data_set)
+    print(data_set)

06-Stacks-Queues-Deques/Exercises/Reinforcement/R6-05.py

@@ -0,0 +1,30 @@
+from collections import deque
+
+class Empty(Exception):
+    """Error attempting to access an element from an empty container"""
+    pass
+
+class DequeQueue:
+    """FIFO Queue implementation using collections.deque as underlying storage"""
+
+    def __init__(self):
+        self._data = deque()
+
+    def __len__(self):
+        return len(self._data)
+
+    def is_empty(self):
+        return len(self._data) == 0
+
+    def first(self):
+        if self.is_empty():
+            raise Empty('Queue is empty')
+        return self._data[0]
+
+    def dequeue(self):
+        if self.is_empty():
+            raise Empty('Queue is empty')
+        return self._data.popleft()
+
+    def enqueue(self,element):
+        self._data.append(element)

06-Stacks-Queues-Deques/Exercises/Reinforcement/R6-11.py

@@ -0,0 +1,65 @@
+class Empty(Exception):
+    """Error attempting to access an element from an empty container"""
+    pass
+
+class ArrayStack:
+    """LIFO Stack implementation using a Python list as underlying storage."""
+
+    def __init__(self):
+        """Create an empty stack."""
+        self._data = []
+
+    def __len__(self):
+        """Return the number of elements in the stack."""
+        return len(self._data)
+
+    def is_empty(self):
+        """Return True if stack is empty."""
+        return len(self._data) == 0
+
+    def push(self,e):
+        """Add element e to the top of the stack."""
+        self._data.append(e)
+
+    def top(self):
+        """Return the element at the top of the stack.
+        
+        Raise empty exception if the stack is empty.
+        """
+        if self.is_empty():
+            raise Empty('Stack is empty.')
+        return self._data[-1]
+
+    def pop(self):
+        """Remove and return the element from the top of the Stack.
+        
+        Raise empty exception if the stack is empty.
+        """
+        if self.is_empty():
+            raise Empty('Stack is empty.')
+        return self._data.pop()
+
+    def __str__(self):
+        """Prints the elements of stack"""
+        result = ''.join(str(self._data[i]) + " " for i in range(len(self._data)))
+        return result
+
+
+
+# Testing
+if __name__ == "__main__":
+    S = ArrayStack()
+    S.push(5)
+    S.push(3)
+    print(len(S))
+    print(S.pop())
+    print(S.is_empty())
+    print(S.pop())
+    print(S.is_empty())
+    S.push(7)
+    S.push(9)
+    print(S.top())
+    S.push(4)
+    print(len(S))
+    print(S.pop())
+    S.push(6)