91Ó°ÊÓ

Describe how to implement a capacity-limited stack, which uses the functions of a capacity-limited deque to perform the functions of the stack ADT in ways that do not throw exceptions when we attempt to perform a push on a full stack or a pop on an empty stack.

Describe how to implement a capacity-limited queue, which uses the functions of a capacity-limited deque to perform the functions of the queue ADT in ways that do not throw exceptions when we attempt to perform a enqueue on a full queue or a dequeue on an empty queue.

Suppose an initially empty stack \(S\) has performed a total of 25 push operations, 12 top operations, and 10 pop operations, 3 of which generated a StackEmpty exception that was caught and ignored. What is the current size of \(S ?\)

Give a recursive function for removing all the elements in a stack.

Describe the output for the following sequence of queue operations: enqueue(5), enqueue(3), dequeue(), enqueue(2), enqueue(8), dequeue(), dequeue(), enqueue(9), enqueue(1), dequeue(), enqueue(7), enqueue(6), dequeue(), dequeue(), enqueue(4), dequeue(), dequeue().

Suppose you have a deque \(D\) containing the numbers (1,2,3,4,5,6,7,8) in this order. Suppose further that you have an initially empty queue \(Q .\) Give a pseudo-code description of a function that uses only \(D\) and \(Q(\text { and no other variables or objects) and results in } D\) storing the elements \((1,2,3,5,4,6,7,8),\) in this order.