Please give the thumbs up, If it is helpful for you. Thank you!!
In pop its doing --top which is top=top-1 so it changes the value of top.
While in peek, its doing top-1 i.e. just decrements top by 1 and use the value, top is unchanged.
See the image for step by step solution:

Suppose that s and I are empty stacks and a, b, c. and d are objects....
JAVA
Question 16 (6 points) Given an empty Queue q and empty Stacks. Show what Q and will look like after the following instructions are executed." for(int i = 0; i < 6; i++){ qenqueuei-2): s push(i-4). while(! q.isEmpty) iffe peek() %2 == 0){ s pop(); 5 push(q.dequeue): else { s.popO: 9.dequete: } www qenqueue speeko): Format BIU $ Question 17 (6 points) The following code defines an exception myException. It is used in testl (String str) and the testl...
Define a class DoubleStack which implements two stacks of objects of type Object using a single shared array, so that the push and pop operations specify which of the two stacks is involved in the operation (as described below). (a) Specify necessary instance variables and write a constructor “DoubleStack(int n)” that takes integer n and creates an empty DoubleStack object with the shared array with room for n elements (2 pt); b) Write methods "boolean push(int i, Object o)" and...
(ii) [6 marks] Assume that we have an empty stack S and an empty queue Q. Given a series of stack operations on S as below: Push(S,10), Push(S, 7), Push(S, 23), Pop(S), Push(S, 9), Pop(S), Pop(S) Output the element returned by each Pop operation. Given a series of queue operations on Q as below: Enqueue(0,10),Enqueue(Q,20), Enqueue(0,33), Dequeue(Q), Enqueue(Q,55), Dequeue(Q), Dequeue(Q) Output the element returned by each Dequeue operation. (iii) [8 marks] Given an empty binary search tree T, draw the...
Suppose the following operations are performed on a queue containing integers. Create an empty queue Push 1 Push 2 Push 3 Pop Push 4 Push 5 Pop Now do the following: a. Draw a sketch of a doubly linked-list based queue after steps 1-4. b. Draw a sketch of a doubly linked-list based queue after all steps 1-8. c. Draw a sketch of a circular array-based queue with capacity 6 after steps 1-4. Specify f, t, and size after each...
Recursively sorting an unbounded stack (java) in ascending order? (This assignment is only limited to stacks only, No other data structures are allowed) My professor gave us a hint on how to implement this, however she wants the comparable interface to be used. im not sure on how to do this. Hint: May want to use a public method that accepts the original stack and then creates the two additional stacks needed. This method then calls a private method that...
Let’s say we have two empty stacks of integers, S1 and S2. Draw a picture of each stack after the following operations: pushStack(S1, 2); //push 2 into S1 pushStack(S1, 4); pushStack(S1, 6); pushStack(S1, 8); pushStack(S1, 10); pushStack(S1, 12); while ( !emptyStack(S1) ) { popStack(S1, x); //pop the top item of S1 and save it to variable x popStack(S1, x); pushStack(S2, x) }
I have added a little Code but I need help with the rest. /** A class of stacks whose entries are stored in a chain of nodes. Implement all methods in MyStack class Main Reference : text book or class notes Do not change or add data fields */ package PJ2; public class MyStack<T> implements StackInterface<T> { // Data fields private Node<T> topNode; // references the first node in the chain private int numberOfEntries; public...
2. Stacks and Queues Reinernber: Consider the following function: void systery( int num) { int current: /* create Stack stk and Queue que / Stacks: the function push places the given parameter on the top of the stack, the function pop removes and returns the top of the stack, and the function empty returns true (i.c., 1) if the stack is empty or false (i.e., 0) otherwise. Queues: the function insert places the given parameter on the end of the...
Stack manipulation: a) The following operations are performed on a stack: PUSH A, PUSH B, POP, PUSH C, POP, PUSH D, POP, PUSH E, POP, PUSH F What does the stack contain after each operation? 1 b) If the input stream is ZYXWV, create a sequence of pushes and pops such that the output stream is XYVWZ. (Note: The input stream of a stack is a list of all the elements we pushed onto the stack, in the order that...
Java - data structures Suppose that in the array-based stack, the array doubles in size after multiple push operations. But later on, fewer than half of the array’s locations might actually be used by the stack due to pop operations. Revise the implementation so that its array also can shrink in size as objects are removed from the stack. Accomplishing this task will require two new private methods, as follows: The first new method checks whether we should reduce the...