what would be the output of the following program: public class StackTest { public static void main(String] args) { ArrayStack st = new ArrayStack(); for(int i = 3; i< 10; i+= 2) st.push( i+ 1); ArrayStack st1 = new ArrayStack(); while(! st.isEmpty()) st1.push(st.pop() + 2); while(! st1.isEmpty() System.out.print(st1.pop() + " "); } } O a. 12 10 6 8 O b.12 10 8 6 O. 10 12 8 6 O d. 6 8 10 12

what would be the output of the following program: public class StackTest { public static void main(String] args) { ArrayStack st = new ArrayStack(); for(int i = 3; i< 10; i+= 2) st.push( i+ 1); ArrayStack st1 = new ArrayStack(); while(! st.isEmpty()) st1.push(st.pop() + 2); while(! st1.isEmpty() System.out.print(st1.pop() + " "); } } O a. 12 10 6 8 O b.12 10 8 6 O. 10 12 8 6 O d. 6 8 10 12

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

public static void main(String[] args) { int[] funky = {1, -5, 3, -5, 6, 6, 6, 7, -5};int expectedFunkyRange = 5; // |6 - 1| = 5System.out.println("Expected funkyRange of " + Arrays.toString(funky) + " to be " + expectedFunkyRange + " and got " + funkyRange(funky));int[] funkyTwo = {6, 6, 4, 4, 4, 2, 2, 8, 4, 1, 1};int expectedFunkyRangeTwo = 4; // |4 - 8| = 4System.out.println("Expected funkyRange of " + Arrays.toString(funkyTwo) + " to be " + expectedFunkyRangeTwo + " and got " + funkyRange(funkyTwo)); Write a static method: public static int WeirdRange(int[] a) that that calculates the difference between the mode and "anti-mode" of an array of integers. This difference should be a positive number (you can use Math.abs to calculate an absolute value). If the array is empty or null, return -1. If the array has only one thing in it, return 0 (since the mode and anti-mode are the same). Definitions: The mode of an array is the element that occurs the most frequently.…
public class arrayOutput ( public static void main (String [] args) { final int NUM ELEMENTS = 3; int[] userVals = new int [NUM_ELEMENTS]; int i; } Type the program's output userVals [0] = 2; userVals [1] = 6; userVals [2] = 8; for (i = userVals.length - 1; i >= 0; −−1) { System.out.println(userVals [1]); } C.C. ? ? ??
java program : Assume the following method is added to the ArrayStack class. What does this method do? public ArrayStack<E> Undefined() { int j = topOfStack; ArrayStack<E> st1= new ArrayStack<E>(topOfStack + 1); for(int i = 0; i < topOfStack + 1; i++) { st1.theData[j] = theData[i]; j-- ; } return st1; } The method will return a stack containing all the elements of “this” stack in the reverse order. The method will return a stack containing the alternative elements of “this” stack in the original order. The method will return a stack containing all the elements of “this” stack in the original order. The method will return a stack containing the alternative elements of “this” stack in the reverse order.
java program : Assume the following method is added to the ArrayStack class. What does this method do? public ArrayStack<E> Undefined() {     int j = topOfStack;     ArrayStack<E> st1= new ArrayStack<E>(topOfStack + 1);     for(int i = 0; i < topOfStack + 1; i++)     {            st1.theData[j] = theData[i];            j-- ;     }     return st1;     } The method will return a stack containing all the elements of “this” stack in the reverse order. The method will return a stack containing the alternative elements of “this” stack in the original order. The method will return a stack containing all the elements of “this” stack in the original order. The method will return a stack containing the alternative elements of “this” stack in the reverse order.
public class ArrayMerge {     static void arrayMerge(int a[], int b[]){ int c[] = new int[50]; int k = 0;     for(int i = 0; i < a.length; i++) { c[k++] = a[i]; }     for(int i = 0; i < b.length; i++) { c[k++] = b[i]; }     for(int i = 0; i < k; i++) { System.out.println(c[i]); } }     public static void main(String[] args) { int a[] = { 18, 36, 41, 78, 56 }; int b[] = { 10, 37, 44 };     arrayMerge(a,b); }   } Calculate the algorithm step number and algorithm time complexity of the above program?
Question 2. package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 {     //         public static void fillArray(Scanner inputFile, int[] arrIn){     int indx = 0; //Complete code                   {       arrIn[indx] = inputFile.nextInt();       indx++;     } }
Code: public class RURottenTomatoes { public static void main (String[] args) { int r = Integer.parseInt(args[0]); int c = Integer.parseInt(args[1]); for ( int i = 0; i < args.length; i++ ) { int[][] array = new int[r][c]; } String input = args[0]; int n = input.length(); String temp; int arrayR = r; int arrayC = c; for ( int i = 0; i < r; i++ ) { temp = input.substring( i, i + 1 ); arrayR = arrayR + Integer.parseInt(temp); for ( i = 0; i < c; c++ ) { temp = input.substring( i + 1, i + 2 ); arrayC = arrayC + Integer.parseInt(temp); } } } } I did all this, but then stuck. I have no idea what to do next, and I think my code is wrong. Can you help me out doing this assignment? Please explain everything that you do clearly! The instructions are below: RU Rotten Tomatoes. Write program RURottenTomatoes.java that creates a 2 dimensional integer array of movie ratings from the command line arguments and displays the index of the movie that has the highest sum of ratings.…
public class Test { } public static void main(String[] args) { int arr[] = {1,2,3,4,5}; int count = 0; for(int i = } = 0; i<5; i++ ) { if(arr[i]%2==0) arr[i] *= 2; System.out.print(arr[i]); }
public class ReplaceEvenWithZero { public static void main(String[] args) { int[]a = new int[]{14, 2, 19, 3, 15, 22, 18, 7, 44, 39, 51, 78} ; // Print array a for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); // Replace the even elements. replaceEven(a); // Print array a again to see new elements. for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); } /** Replace the even elements in the given array with 0 @param arr the array to use for the replacements */ public static void replaceEven(int[] arr) { //-----------Start below here. To do: approximate lines of code = 2 // Write a for loop to go through each element, determine if it is even //If so, replace with 0. Hint: use the modulus operator % to determine if an…
public static void simpleLoop(int total) { String tmp = ""; for (int x = 0; x < total; x++) { tmp + (x + ","); } } } System.out.println(tmp.length()); public static void main(String[] args) { simpleLoop (2);
JAVA language
Java output caffeine levels