Java Program:please choose an aswer: What is the output of the following program?public class StackTest{public satic viod main(String[] args){ArrayStack st1=new ArrayStack();ArrayStack st2=new ArrayStack ();for(int i = 1; i <= 6; i++)st1.push(i);while(Ist1.isEmpty() {int item = st1.pop0;if(item % 2 == 0)st2.push(item);}while(!st2.isEmpty())st1.push(st2.pop();while(!st1.isEmpty(0)System.out.print(st1.pop() + " ");(A) 642(в) 135246(D) 531

After for loop- 6 5 4 3 2 1 st1 After 1st while loop st1 become empty and st2 - 2…

What is the output of the following program? public class StackTest { public satic viod main(String] args) { ArrayStack st1=new ArrayStack): ArrayStack st2=new ArrayStack 0: for(int i = 1; i <= 6; i++) st1.push(i); whileist1.isEmptYO) f

What is the output of the following program? public class StackTest { public satic viod main(String] args) { ArrayStack st1=new ArrayStack): ArrayStack st2=new ArrayStack 0: for(int i = 1; i <= 6; i++) st1.push(i); whileist1.isEmptYO) f

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 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?
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. ? ? ??
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 FindArrayDifference { static void arrayDifference(int a[], int b[]) { int k = 0; int [] c = new int[a.length]; for(int i=0; i < a.length; i++) { int j; for(j = 0; j < b.length; j++) if(a[i] == b[j]) break; if(j == b.length) c[k++] = a[i]; } for(int j = 0; j < k; j++) System.out.println(c[j]); } public static void main(String[] args) { int a[] = {1,2,3,7,8,15,26}; int b[] = {1,2,3,15,4,8,6}; arrayDifference(a,b); } } Calculate the algorithm step number and algorithm time complexity of the above program?
Enhanced selection sort SelectionSortDemo.java package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue =…
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.
a) FindMinIterative public int FindMin(int[] arr) { int x = arr[0]; for(int i = 1; i < arr.Length; i++) { if(arr[i]< x) x = arr[i]; } return x; } b) FindMinRecursive public int FindMin(int[] arr, int length) { if(length == 1) return arr[0]; return Math.Min(arr[length - 1], Find(arr, length - 1)); } What is the Big-O for this functions. Could you explain the recurisive more in details ?
package arreyreview; public class HoursAndPayAngela { public static void main(String[] args) { int [] [] hours = new int [7] [5]; for (int row = 0; row < 7; row++){ for(int col = 0; col < 5; col++){ hours[row][col]= (int) (Math.random()*11); System.out.print(hours[row][col]+" "); } System.out.println(); } System.out.println(); int [] totalEmp = new int [5]; for (int col = 0; col < 5; col ++){ totalEmp[col] = 0; for (int row = 0; row < 7; row ++){ totalEmp[col]+=hours[row][col]; } System.out.println("Total for employee " + col + " is " + totalEmp[col] ); } System.out.println(); int count = 0; for(int row = 0; row < 7; row++){ count = 0; for(int col = 0; col < 5; col ++){ if(hours[row][col]!=0) count+= 1; } System.out.println("On day: " + row + " " + count + " workers worked."); } System.out.println(); } } a) If each employee was paid $20.5 per hour calculate and output the weekly earnings for each employee. b) Calculate and output how much all employees…
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverse Words (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
Return an ArrayList containing the largest and smallest integer inan array. If the array is empty, return the largest andsmallest as 0. languages java please help me thanks
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverseWords (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird