0:00 IZVV58Stack s - new Stack();s. push(10);s. push(20);s. push(30);s. push(40);// stack created with elements- 10 20 30 4059606162636465sum(s);66public static void sum(stack s){Integer sum = 0;stack tmp = new Stack();// move the stack to new stack, it will be in reverse orde// simultaneously sum the elementswhile (Is.isEmpty())(tmp.push(s.pop();sum t tmp.peek();6768697071727374sum t= tmp.peek ();7475// move to original stackwhile (Itmp.isEmpty()){s.push(tmp.pop());system.out.println("sum= "+sum.tostring());OUTPUT-10 pushed into stack20 pushed into stack30 pushed into stack40 pushed into stack40 pushed into stack30 pushed into stack20 pushed into stack10 pushed into stack10 pushed into stack20 pushed into stack30 pushed into stack40 pushed into stackSum= 100Sum of 10, 2O, 30, 40 = 100I hope it helps. For any doubt, feel free to ask incomments, and give upvote if u get the answer.

I give the code in java as per your requirement along with code and output screenshot

Stack s- new Stack(); s. push(10); s. push(20); s.push(30); s.push(40); // Stack created with elements- 10 20 30 40 60 61 62 63 64 65 (s)ans 66 67 public static void sum(Stack s){ Integer sum - 0; stack tmp = new Stack(); // move the stack to new stack, it will be in reverse orde // simultaneously sum the elements while (Is.isEmpty())( tmp.push(s.pop()); Sum tap.peek); 70 71 73 74 sum tmp.peek(); 74 75 // move to original stack while (Itmp.isEmpty()){ s. push(tmp.pop(); 76 system.out.printin("Sum= "+sum.tostring()); } OUTPUT- 10 pushed into stack 20 pushed into stack 30 pushed into stack 40 pushed into stack | 40 pushed into stack 30 pushed into stack 20 pushed into stack 10 pushed into stack 10 pushed into stack 20 pushed into stack 30 pushed into stack 40 pushed into stack Sum= 100

Stack s- new Stack(); s. push(10); s. push(20); s.push(30); s.push(40); // Stack created with elements- 10 20 30 40 60 61 62 63 64 65 (s)ans 66 67 public static void sum(Stack s){ Integer sum - 0; stack tmp = new Stack(); // move the stack to new stack, it will be in reverse orde // simultaneously sum the elements while (Is.isEmpty())( tmp.push(s.pop()); Sum tap.peek); 70 71 73 74 sum tmp.peek(); 74 75 // move to original stack while (Itmp.isEmpty()){ s. push(tmp.pop(); 76 system.out.printin("Sum= "+sum.tostring()); } OUTPUT- 10 pushed into stack 20 pushed into stack 30 pushed into stack 40 pushed into stack | 40 pushed into stack 30 pushed into stack 20 pushed into stack 10 pushed into stack 10 pushed into stack 20 pushed into stack 30 pushed into stack 40 pushed into stack Sum= 100

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Problem 2: Assume that the methods push(), pop() and isEmpty() methods are defined as they should be in a Stack class. Assume further that the Stack class has a no argument constructor. Write a method that uses the constructor and the methods push(), pop() and isEmpty() for removing and returning the bottom element of a given stack. Note: make sure that you don't include unnecessary spaces in your answers! public T popBottom(Stack stack) { Stack tempStack = new Stack(); Tx = null; if (!stack.isEmpty()) { x = stack.pop(); } while (!stack.isEmpty()) { #04 ; x = stack.pop(); } while (!tempStack.isEmpty()) { #05 ; } return x; }
Knowledge of Stack Data Structure is a must. Create a stack data structure that can hold at most 10 items. Operations: Push, adds a new item on top of the stack. Pop, removes the item on top of the stack Top, returns the top item on top of the stack To add item on top of the stack, enter PUSH followed by the value ex. PUSH 20 To remove the item on top of the stack, enter POP ex. POP To print the value on top of the stack, enter TOP and it will print the top value and exit the loop. ex. TOP Rest assured that the input will not generate IndexOutOfBoundsException Input 1. Operation e.g. PUSH 10, POP, TOP Description PUSH operation always comes first. Number of POP operations is equal to number of PUSH operations TOP will be the last. Sample PUSH·10 PUSH·20 POP TOP Output Enter·PUSH·N·to·add·value,·N·is·int·value Enter·POP·to·remove·value Enter·TOP·to·print·final·result: PUSH·10 PUSH·20 POP TOP 10
solution for subpart 3
Consider the following statements: stackType<int> stack; int x; Suppose that the input is: 14 53 34 32 13 5 -999 Show what is output by the following segment of code: cin >> x; while (x != -999) { if (x % 2 == 0) { if (!stack.isFullStack()) stack.push(x); } else cout << "x = " << x << endl; cin >> x; } cout << "Stack Elements: "; while (!stack.isEmptyStack()) { cout << " " << stack.top(); stack.pop(); } cout << endl;
Determine how the stack behaves when it is permitted to operate on its own.
Please elaborate on the distinction between the bound and unbounded stack.
solution for subpart 4
Determine how the stack performs when allowed to be itself.
C++ Write a program that uses a stack to print the prime factors of a positive integer (input by the user) in descending order.
Given that a stack starts like this: 4 12 10 2 3 Give the output of a stack if the following instructions are executed: Push (25); Push (9); Push (73); Pop (), Pop, Pop Select one: A. 9 73 10 B. 4 12 10 2 3 C. 73 9 25 D. 4 12 25 73
What are the different operations that can be performed on a stack?