1- Assume that we have a stack (s1) that contains some letters as follows: s1.push ('r'); s1.push ('a'); s1.push ('d'); s1.push ('a'); s1.push ('r'); Assume that we have another stack (s2) that contains some numbers and a character 'X' as follows: s2.push (3); s2.push (5); s2.push (8); s2.push ('X'); s2.push (4) ; s2.push (14); Write a Java main program that inserts the elements of stack s1 into the stack s2 where the char 'X' exists. After insertion, print the stack s2 only. At the end of the program, the stack s1 can be empty, but the stack s2 must contain the numbers and characters.

1- Assume that we have a stack (s1) that contains some letters as follows: s1.push ('r'); s1.push ('a'); s1.push ('d'); s1.push ('a'); s1.push ('r'); Assume that we have another stack (s2) that contains some numbers and a character 'X' as follows: s2.push (3); s2.push (5); s2.push (8); s2.push ('X'); s2.push (4) ; s2.push (14); Write a Java main program that inserts the elements of stack s1 into the stack s2 where the char 'X' exists. After insertion, print the stack s2 only. At the end of the program, the stack s1 can be empty, but the stack s2 must contain the numbers and characters.

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 21SA

See similar textbooks

Similar questions

The following operations are performed on a stack:PUSH A, PUSH B, POP, PUSH C, PUSH D, POP, PUSH E, POP, POP, PUSH FWhat does the stack contain after the PUSH F?a. Fb. A B C D E Fc. A C Fd. A Fe. none of the above.
The Nth Fibonacci number is defined as the sum of the two previous Fibonacci numbers where the 0th and 1st Fibonacci numbers are defined as 1. What is the maximum size of the stack when this function is called with the argument 5? What is the maximum size of stack when the function is called with n when n >= 4 (expression in term of n) int Fibonacci( int n ) { return (n <= 1) ? 1 : Fibonacci( n - 1 ) + Fibonacci( n - 2 ); }
Machine organization The following operations are performed on a stack: PUSH A, PUSH B, POP, PUSH C, POP,POP,PUSH D, PUSH E, POP, PUSH F. What does the stack contain after each operation?
Suppose the following operations were performed on an empty stack:pus h(8);pus h(?);pop();push (19);pus h(21);pop();Insert numbers in the following diagram to show what will be stored in the staticstack after the operations have executed
Create a stack S of ten elements. Take a number x from the user and delete the elements smaller than or equal to X from the stack.Example: Suppose your initial stack is S where you pushed 10 elements as below- Top {9, 3, 4, 15, 20, 1, 6, 4, 9, 10} Bottom4. X is taken as input and X= 6. Then pop out and remove the elements smaller than or equal to X. Finally, the stack will look like-Top {9, 15, 20, 9, 10} BottomYou can use only one additional queue to solve this problem.In c++ please
What values are returned during the following series of stack operations, if executed upon an initially empty stack? push(4), push(2), pop(), push(1), push(7), pop(), pop(), push(8), push(9), pop(), push(6), push(5), pop(), pop(), push(3), pop(), pop(). Group of answer choices a) 4, 2, 7, 9, 5, 3 b) 4, 2, 1, 7, 8, 9, 6, 5, 3 c) 2, 7, 1, 9, 5, 6, 3, 8
Code in C One of the applications of a stack is to backtrack - that is, to retrace its steps. As an example, imagine we want to read a list of items, and each time we read a negative number we must backtrack and print the five numbers that come before the negative number and then discard the negative number. Use a stack to solve this problem. Use a stack and push them into the stack (without printing them) until a negative number is read. At this time, stop reading and pop five items from the stack and print them. If there are fewer than five items in the stack, print an error message and stop the program. After printing the five items, resume reading data and placing them in the stack. When the end of the file is detected, print the message and the items remaining in the stack. Sample Output 1 2 3 4 5 6 7 -1 7 6 5 4 3 9 6 4 3 -2 3 4 6 9 2 -3 Number of items left is less than five! Program is terminating! Project name : Backtrack Filenames: backtrack.h, backtrack.c,…
Select true or false for the statements below. Explain your answers if you like to receive partial credit 4) Given a stack implemented as a standard linked list (only a head pointer) with O(1)push and O(1) pop, and the following functions are performed in sequence:Push(“Charmander”), Push(“Squirtle”), Push(“Bulbasaur”), Pop(), Push(“Larvitar”),Push(“Eevee”), Pop(), Pop()Which of the following is true after all the functions are executed?a. Charmander and Squirtle will be the only elements left on the stackb. The head node will be pointing to Charmanderc. If you Push(“Pikachu”), it will be the last node of the linked list
A stack has following variables initialized, answer question 5 &6 using these values int size = 7; int top = —1; int [ ] arr = new int [size] ; Q5. What will be value of the top variable when the stack is empty? Q6. What will be value of the top variable when the stack is full?
A SpecialStackTM is a stack modified to support the following two operations: PUSHCLEAR(v) successively pops consecutive items from the top of the stack that are less than u, then pushes v onto the stack. POP() deletes the item at the top of the stack. Assume these operations are implemented using a singly-linked list. PUSHCLEAR(v) iter- ates through the linked list to pop the applicable items and then adds v to the beginning. POP() deletes the first item. (a) Describe the ordering of values on the stack. (b) Explain how a single call to PUSHCLEAR(V) could take (n) time. (c) If we assume that every operation takes linear time, we get a naive bound of O(n²) on the total runtime. But this doesn't consider the fact that these expensive operations happen infrequently so let's analyze it more closely. Show that any sequence of n operations takes O(n) time. -
Imagine a stack of dishes, literally. The stack may collapse if it becomes too tall.Therefore, when the prior stack above a certain threshold in real life, we probably start a new stack. Create a data structure called SetOfStacks to resemble this. When a stack's capacity is reached, a new stack should be created and added to the SetOfStacks. SetOfStacks. SetOfStacks with push(). In other words, pop() should return the same values as it would if there were only one stack. It should operate exactly like a single stack.TAKE ACTIONCreate a function called popAt(int index) that does a pop operation on a certain substack.
A letter means push and an asterisk means pop in the following sequence. Give the contents of s[0], ..., s[4] after the execution of this sequence of operations performed on an initially empty LIFO stack. L A * S T I * N * F I R * S T * * O U * T * * * * * *