1. Scan P from left to right and repeat Steps 3 to 6 for each element of P until the stack is empty. 2. If an operand is encountered, add it to Q. 3. If a left parenthesis is encountered, push it onto stack. 4. If an operator & is encountered, then: (a) Repeatedly pop from stack and add to Q each operator (on the which has the same precedence as, or higher precedence than O. (b) Add O to stack. 5. If a right parenthesis is encountered, then: (a) Repeatedly pop from stack and add to Q (on the top of stack until a left parenthesis is top of stack), encountered. (b) Remove the left parenthesis. [Do not add the left parenthesis to stack.] 6. Exit.

1. Scan P from left to right and repeat Steps 3 to 6 for each element of P until the stack is empty. 2. If an operand is encountered, add it to Q. 3. If a left parenthesis is encountered, push it onto stack. 4. If an operator & is encountered, then: (a) Repeatedly pop from stack and add to Q each operator (on the which has the same precedence as, or higher precedence than O. (b) Add O to stack. 5. If a right parenthesis is encountered, then: (a) Repeatedly pop from stack and add to Q (on the top of stack until a left parenthesis is top of stack), encountered. (b) Remove the left parenthesis. [Do not add the left parenthesis to stack.] 6. Exit.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

12.22 Show how to replace the related stack with a single reference in an in-order traversal by removing the accompanying stack. (Hint: The items below the stack top are decided by the stack top; we just need to know the top of the stack.) 12.23 Which additional traversals can be reformulated by substituting a single reference for their Linear structure? How does this modification affect how complicated each iteration is?
Given the following sequence of characters: DA&T!A ST*R&U!CT!&UR*ES. Consider the stack data structure, supporting two operations push and pop. Suppose that for the above sequence, each letter (such as DATA STRUCTURES) corresponds to a push of that letter onto the stack, each exclamation mark(!) corresponds one pop operation on the stack, each ampersand (&) corresponds one peep operation on the stack and each asterisk (*) corresponds two pop operations on the stack. Show the sequence of values returned by the pop operations. Also, display the remaining elements in the stack after all the push and pop operations.
Use procedures PUSH(S,X), POP(S,X), PRINT(X) andEMPTY_STACK(S) (as described in illustrative problem 4.1) andTOP_OF_STACK(S), which returns the top element of stack S, to write pseudocodes toi) assign X to the bottom element of stack S, leaving the stack empty;ii) assign X to the bottom element of the stack, leaving the stack unchanged;iii) assign X to the nth element in the stack (from the top), leaving the stackunchanged.
Imagine a (literal) stack of plates. If the stack gets too high, it might topple.Therefore, in real life, we would likely start a new stack when the previous stack exceeds somethreshold. Implement a data structure SetOfStacks that mimics this. SetOfStacks should becomposed of several stacks and should create a new stack once the previous one exceeds capacity.SetOfStacks. push() and SetOfStacks. pop() should behave identically to a single stack(that is, pop () should return the same values as it would if there were just a single stack).FOLLOW UPImplement a function popAt(int index) which performs a pop operation on a specific substack.
PP 12.4 The array implementation in this chapter keeps the top variablepointing to the next array position above the actual top of thestack. Rewrite the array implementation such that stack[top] isthe actual top of the stack. PP 12.5 There is a data structure called a drop-out stack that behaves likea stack in every respect except that if the stack size is n, whenthe n + 1 element is pushed, the first element is lost. Implement adrop-out stack using an array. (Hint: A circular array implementation would make sense.)
There is a data structure called a drop-out stack that behaves likea stack in every respect except that if the stack size is n, whenthe n + 1 element is pushed, the first element is lost. Implement adrop-out stack using an array. (Hint: A circular array implementation would make sense.)
2. Given the following stack A = { 29,18,10,15,20,9,5,13,2,4,15} Create a queue by taking the elements from the top of the stack and adding them to a queue
There is a data structure called a drop-out stack that behaveslike a stack in every respect except that if the stack size is n,then when the n+1 element is pushed, the first element is lost.Implement a drop-out stack using links
Sort the stack values either ascending or descending without using stack builtin classes for eg Stack before sorting : 5 | -2 | 9 | -7 | 3 where 3 is the top elementStack after sorting : -7 | -2 | 3 | 5 | 9 where 9 is the top element by using c/c++ labguage
Pseudocodes can be written using the operations PUSH(S,X), POP(S,X), PRINT(X), EMPTY STACK(S), and TOP OF STACK(S), which returns the top element of stack S. i) assign X to the bottom element of stack S, leaving the stack empty;ii) assign X to the bottom element of the stack, leaving the stack unchanged;iii) assign X to the nth element in the stack (from the top), leaving the stack unchanged.
Use procedures PUSH(S,X), POP(S,X), PRINT(X) andEMPTY_STACK(S) and TOP_OF_STACK(S), which returns the top element of stack S, to write pseudo codes toi) assign X to the bottom element of stack S, leaving the stack empty;ii) assign X to the bottom element of the stack, leaving the stack unchanged;iii) assign X to the nth element in the stack (from the top), leaving the stackunchanged.
The queues that function as a stack together work on X) and POP(S, Y), where S is purportedly a stack, X is the element to be added to S, and Y is the element discarded from S. Assume that only queues are accessible to ADT's ENQUEUE, DEQUEUE, and EMPTYQUEUE operations.Show how your function operates on a list of items (a, b, and c) that will be used as a stack by the queues Q1 and Q2.