4. Trace the given program and draw the content of stack step-by-step as the program executes. 1 import java.util.Stack; 2 public class playStack { 30 public static void main(String[] args) { Stacks = new Stack(); int n1, n2; s.push(15); s.push(8); n1 = s.peek() + 2; s.push(n1+6); n2 = s.peek() ; s.push(n1 + n2); n2 = s.peek() ; s.pop(); s.push(13); n1 = s.peek(); s.pop(); while (!s.empty()) { System.out.println (s.peek()); s.pop(); 4567 4 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 } }

4. Trace the given program and draw the content of stack step-by-step as the program executes. 1 import java.util.Stack; 2 public class playStack { 30 public static void main(String[] args) { Stacks = new Stack(); int n1, n2; s.push(15); s.push(8); n1 = s.peek() + 2; s.push(n1+6); n2 = s.peek() ; s.push(n1 + n2); n2 = s.peek() ; s.pop(); s.push(13); n1 = s.peek(); s.pop(); while (!s.empty()) { System.out.println (s.peek()); s.pop(); 4567 4 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 } }

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

C# Display the stack with the given information: int topNum; NumberStack stack2 = new NumberStack(5); stack2.Push(5);stack2.Push(7);stack2.Push(12);stack2.Push(3); public void PrintStack() { //Loop through each element of the stack and display it for (int i = size - 1 ; i >= 0; i--) { Console.WriteLine(stack[i]); } }
Multiple choice in data structures void stack::do(){ for(int i=0li<=topindex/2;i++){ T temp=entry[i]; entry[i]=entry[topindex-i-1]; entry[topindex-1-i]=temp;} } What is this method do? a. swap the first item with last item b. replace each item with next item value c. doesn't do any thing d. reverse the stack
Evaluate the following statement using stack :T = fib (3) ; Where fib ( ) defined as follows : int fib(int n){ if ((n == 0 ) || (n ==1))return n;elsereturn fib(n-1) + fib(n-2);}
C# Why would this not work?: NumberStack stack2 = new NumberStack(5); public void PrintStack() { //Loop through each element of the stack and display it for (int i = size - 1 ; i >= 0; i--) { Console.WriteLine(stack[i]); } } Console.WriteLine(stack2.PrintStack()); -> provides an error "error CS1503: Argument `#1' cannot convert `void' expression to type `bool'"
A Stack is a data structure for storing a list of elements in a LIFO (last in, first out) fashion. Design a class called Stack with three methods. void Push(object obj)object Pop()void Clear() We should be able to use this stack class as follows:var stack = new Stack();stack.Push(1);stack.Push(2);stack.Push(3);Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop()); The output should be 3, 2, 1
Working with Stacks 1. Create a method on the Stack class that determines whether a given value occurs consecutively in the stack. bool Stack::isConsecutive( const T & data ) const; Example: isConsecutive(…) function Result Stack isConsecutive (5) true top->(1) (1) (5) (3) (5) (5) (2) isConsecutive (3) false top->(1) (1) (5) (3) (5) (5) (5) (2) 2. Create a method on the Stack class that reverses the values on the stack. void Stack::reverse(); Example: reverse() function Stack original Result: Stack reversed reverse () top->(1) (1) (5) (3) (5) (5) (2) top->(2) (5) (5) (3) (5) (1) (1) reverse () top->(1) (1) (5) (3) (5) (5) (5) (2) top->(2) (5) (5) (5) (3) (5) (1) (1)
Create a program that loads the following elements in a stack. (Oppo, Realme, Samsung, Huawei, Vivo). Remove the last element in the stack and display the remaining elements. Show also the size of the stack and find the position of the element ‘Vivo’ in the stack.
Assuming that the stack called "names" is defined as below, please answer the following questions: Philip Dustin Robin Debbie Rích Perform the following sequence of operations. 1) What is the result of each operation? 2) show the new stack: please write down each element of the new stack, from the top of the stack to the bottom of the stack String head = names.pop(); String nextTop = names.peek(); names.push("Alan"); names.push("Robert"); head = names.pop(); names.push("Sam"); while (!names.isEmpty()) { } System.out.println(names.pop());
C# Reverse the stack - This procedure will reverse the order of items in the stack. This one may NOT break the rules of the stack. HINTS: Make use of more stacks. Arrays passed as parameters are NOT copies. Remember, this is a procedure, not a function. private int [] stack; private int size; public void ReverseStack(){ }
.) The following stack stores a stack of integers. Draw the stacks and determine what is the output of the following program? import java.util.*; public class TestStack1 { public static void main(String ... args) { Stack<Integer> s = new Stack< >( ); s.push(-54); s.push(27); s.push(31); System.out.println(s.pop( )); Integer v = s.pop( )+ s.pop( ) % 3; s.push(v); s.push(21); int w = s.pop( ); int x = s.pop( ); s.push(x % w - v); System.out.println(s.pop( )); Integer a=-2, b=5, c=22, d=4; s.push(a); s.push(b); s.push(c); s.push(d); s.push(s.pop( ) + s.pop( )); s.push(s.pop( ) * s.pop( )); while(!s.empty()) {System.out.println(s.pop( ));} } }
Given Stack names=new Stack(); String temp="A"; names.push("John"); names.push("Mary"); temp=names.pop(); names.push("Jim"); temp=names.pop(); temp=names. pop(); System.out.println(temp); What is the output?
In Python: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.