Use procedures PUSH(S,X), POP(S,X), PRINT(X) and EMPTY_STACK(S) (as described in illustrative problem 4.1) and TOP_OF_STACK(S), which returns the top element of stack S, to write pseudo codes to 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) and EMPTY_STACK(S) (as described in illustrative problem 4.1) and TOP_OF_STACK(S), which returns the top element of stack S, to write pseudo codes to 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

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 3PE

See similar textbooks

Similar questions

Consider the Stack ADT: Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. ENG
4. Sort elements in an array-based stack in ascending order, i.e. make the smallest element to be the top element of the stack. E.g. given the stack elements (from bottom to top): 90, 70, 80, 10, sort the elements to make the stack elements become (from bottom to top): 90, 80, 70, 10. The only data structure you can use is array-based stack. In addition to the given stack, you can use only one extra stack to store some temporary data. Given a stack st, use one extra stack, tmpst, to store temporary data. Here are some hints of the idea. Pop out the top element of st to a variable tmp. If the stack tmpst is empty, push tmp onto tmpst; if tmpst is not empty, pop out its top element and push that element onto st until the top element of tmpst is smaller than tmp, then push tmp onto tmpst .. a. Write a program to implement the stack based sorting. b. Take the input (90, 70, 80, 10) as an example. c. Print all the push and pop operations in proper format. d. At the end, print the sorted…
A data structure known as a drop-out stack functions exactly like a stack, with the exception that if the stack size is n, the first element is lost when the n + 1 element is pushed. Use an array to implement a drop-out stack. (Hint: It would make sense to implement a circular array.)
Consider the following stack, which can be written as [70, 10, 50, 80, 20] i.e. the "top" of the stack is the first element in the list Consider the following code (written as pseudocode): myfunction( stack1 ) stack2 = createStack() while stack1 is NOT empty value = top(stack1) pop(stack1) while stack2 is NOT empty and top(stack2) > value push(stack1, top(stack2)) pop(stack2) push(stack2, value) print(stack2) // Prints the current stack as [element_1, element_2, ..., element_n] return stack2 From the answers below, select the correct output for the first 4 print statements if myFunction is executed with: myFunction( [ 70, 10, 50, 80, 20] )
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.
Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. None of these choices allows for an efficient implementation of all methods.
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.
A data structure known as a drop-out stack functions exactly like a stack, with the exception that if the stack size is n, the first element is lost when the n + 1 element is pushed. Apply an array to a drop-out stack. (Hint: It would make sense to implement a circular array.)
Complete the following ():a. A stack is used by the system when a function call is madeb. A stack can become full during program execution
Develop an application using java language that store characters A, B and C in a stack array and then displays both the size and the last-in element of the stack. The application should then remove the last element of the stack and then display again both the size and the last-in element of the stack. Appropriate stack methods should be used to add, delete and display characters.
Two stacks S1 and S2 can be implemented using one array. Write procedures: PopS1(Stack), PushS1(Stack,x), PopS2 (Stack), PushS2(Stack,x). The procedures should not declare an overflow unless every slot in the array is used.
54. What is the difference between the top and pop operations of a stack? Group of answer choices The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack and remove it. The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack without removing it. The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack without removing it. The pop and top operations are doing the same thing which removes the top item of the stack. The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack and remove it.