Trace the output of the following program and explain how the program executes. 1 import java.util.*; 2 public class intStack{ 30 public static void main(String[] args) { 4 StackstackOne = new Stack(); System.out.println(stackOne.empty()); for (int i = 0; i < 5; i++) stackOne.push(new Integer (i*10)); System.out.println(stackOne.peek()); Stack stackTwo = new Stack(); while (!stackOne.empty()) stackTwo.push(stackOne.pop()); System.out.println(stackTwo.peek()); 45 5 6 7 8 9 he 11 12 13 14 15} }

Trace the output of the following program and explain how the program executes. 1 import java.util.; 2 public class intStack{ 30 public static void main(String[] args) { 4 StackstackOne = new Stack(); System.out.println(stackOne.empty()); for (int i = 0; i < 5; i++) stackOne.push(new Integer (i10)); System.out.println(stackOne.peek()); Stack stackTwo = new Stack(); while (!stackOne.empty()) stackTwo.push(stackOne.pop()); System.out.println(stackTwo.peek()); 45 5 6 7 8 9 he 11 12 13 14 15} }

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

RPN.java import java.util.Scanner; /** * Reverse Polish Notation calculator. It evaluates * a string with expressions in RPN format and prints * the results. Exampel of a stack use. */public class RPN{ /** * Given a string, return an integer version of * the string. Check if the string contains only * numbers, if so, then does the conversion. If * it does not, it reurns 0. * @param t string with numeric token * @return int version of the numeric token in t */ public int getValue(String t) { if (t.matches("[0-9]+")) { return Integer.parseInt(t); } else { return 0; } } /** * Evaluates a single token in an RPN expression. If it is * a number, it pushes the token to the stack. If it is an * operator, then it pulls 2 numbers from the stack, performs * the operation and pushes back into the stack the result. * @param token to be evaluated * @param stack holding values for…
import java.util.*; public class Main{ public static void main(String[] args) { Main m = new Main(); m.go(); } private void go() { List<Stadium> parks = new ArrayList<Stadium>(); parks.add(new Stadium("PNC Park", "Pittsburgh", 38362, true)); parks.add(new Stadium("Dodgers Stadium", "Los Angeles", 56000, true)); parks.add(new Stadium("Citizens Bank Park", "Philadelphia", 43035, false)); parks.add(new Stadium("Coors Field", "Denver", 50398, true)); parks.add(new Stadium("Yankee Stadium", "New York", 54251, false)); parks.add(new Stadium("AT&T Park", "San Francisco", 41915, true)); parks.add(new Stadium("Citi Field", "New York", 41922, false)); parks.add(new Stadium("Angels Stadium", "Los Angeles", 45050, true)); Collections.sort(parks, Stadium.ByKidZoneCityName.getInstance()); for (Stadium s : parks) System.out.println(s); }}…
Im trying to figure out a java homework assignment where I have to evaluate postfix expressions using stacks and Stringtokenizer as well as a isNumber method. when I try to run it it gives me an error. this is the code I have so far: static double evaluatePostfixExpression(String expression){ // Write your code Stack aStack = new Stack(); double value1, value2; String token; StringTokenizer tokenizer = new StringTokenizer(expression); while (tokenizer.hasMoreTokens()) { token = tokenizer.nextToken(); if(isNumber(expression)) { value1 = (double)aStack.pop(); value2 = (double)aStack.pop(); if (token.equals("+")) { aStack.push(value2+value1); } else if (token.equals("-")) { aStack.push(value2-value1); } else if (token.equals("*")) { aStack.push(value2*value1); } else if (token.equals("/")) { aStack.push(value2/value1); } } }…
Continue the attached code(MainStack.java) so that it will ask the user to enter a choice: (1) Is empty? ----- checks if the stack is empty, returns a text "empty" otherwise "not empty" (2) Search an Item It should ask the item you're looking for from stack and return its location(l-based location). If the item is not present, it will return "No such Item" text. (3) Clear All empty. This makes the stack
2. Complete the following program, trace and give the output. 1 import java.util.*; 2 public class stackProgram{ 30 public static void main(String[] args) { Stack stack1 = ; //insert "A", "B", "C", "D", in the stack 2 3 4 9 5 10 11 6 __); 13 // Prints the top of the stack ("D") System.out.println("Top element is: " // search from the top of the stack System.out.println("C is present at " + stack1.search("C")+"positions from top"); stack1.pop(); // removing the top ("D") 15 7 // removing the next top ("C") 17 18 // Returns the number of elements present in the stack System.out.println("Stack size is " + stack1.size()); // check if stack is empty 19 20 if ( 8 System.out.println("Stack is Empty"); else System.out.println("Stack } ن is not Empty");
Develop a java code to save the following string {"Lab", "Assessment", "total" "Marks", "is 5"} in Stack then: + Display the content of the stack 4 Delete one element of the stack
consider the following example java program which uses recursion to compute fibonnacci number ; show the contents of the runtime stack when this program runs. show each step ( calling and returning steps ) including full ARIs ( activation ınstances)
OCaml Code: The goal of this project is to understand and build an interpreter for a small, OCaml-like, stackbased bytecode language. Make sure that the code compiles correctly and provide the code with the screenshot of the output. Make sure to have the following methods below: -Push integers, strings, and names on the stack -Push booleans -Pushing an error literal or unit literal will push :error: or :unit:onto the stack, respectively -Command pop removes the top value from the stack -The command add refers to integer addition. Since this is a binary operator, it consumes the toptwo values in the stack, calculates the sum and pushes the result back to the stack - Command sub refers to integer subtraction -Command mul refers to integer multiplication -Command div refers to integer division -Command rem refers to the remainder of integer division -Command neg is to calculate the negation of an integer -Command swap interchanges the top two elements in the stack, meaning that the…
please check my JAVA code. One of my test cases is wrong. The question is as stated in the image My answer: import java.util.*; public class BalanceSymbolChecker { public static void main(String[] args) { Scanner scn=new Scanner(System.in); Stack<Character> stack=new Stack<Character>(); String str=scn.nextLine(); // take input boolean ans=false; int flag=0; while(str.length()!=0) { char ch=str.charAt(0); str=str.substring(1); if(stack.isEmpty()&&(ch==')'||ch==']'||ch=='}'||ch=='>')) { flag=1; break; } else if(ch=='('||ch=='['||ch=='{'||ch=='<') { stack.push(ch); } else if(ch==')') { char top=(char) stack.peek(); if(top=='(') { stack.pop(); } } else if(ch==']') { char top=(char) stack.peek();…
7. (* =: 'a In this problem, you will determine what the following method does. public static void rra(int[] list, int start, int end) { if (start >= end) { return; } int tmp = list[start]; list [start] = list[end] = tmp; list[end]; // recursion! rra(list, start+1, end-1); } Suppose list = [0, 2, 4, 6, 8, 10, 12, 14, 16]. (a) ) W= ta . What happens to list when rra(list, 0, 4) is called? Show memory diagrams and/or stack frames to explain what the recursive calls are. (b) (в) с oj What happens to list when rra(list, 0, list.length - 1) is called? st Show memory diagrams and/or stack frames to explain what the recursive calls are.
do not use the work of others
JAVA: Write a recursive method named threeSum that accepts a list of integers and prints all combinations of three integers in the list that sum to 0. For example, if given the list [-1, 0, 1, 2, -1, -4], print the following lines of output: [-1, 0, 1] [-1, 2, -1] [0, 1, -1] You may print the lines of output in any order. The elements in each three-element sublist should appear in the same relative order that they appeared in the original list. Do not print duplicate lists; if the same exact sublist can be made in multiple ways, print it only once. If there are no combinations of three elements that sum to 0, print no output. The list passed to your method must be back to its original state at the end of the call. Either do not modify it, or if you modify it, fully undo your modifications before the method returns. Constraints: Do not declare any global variables. You can use any data structures you like, and your code can contain loops, but the overall algorithm must be recursive and…