What is the output of the following program? public class StackTest public satic viod main(String] args) ArrayStack sti=new ArrayStack(); ArrayStack st2=new ArrayStack (); for(int i = 1; i <= 6; i++) st1.push(i); while(!st1.isEmpty0) { int item = st1.pop(): if(item % 2 == 0) st2.push(item); while(ist2.isEmpty0) st1.push(st2.pop(); while(Ist1.isEmpty0) System.out.print(st1.pop() - "): 135 B 642 246 531

What is the output of the following program? public class StackTest public satic viod main(String] args) ArrayStack sti=new ArrayStack(); ArrayStack st2=new ArrayStack (); for(int i = 1; i <= 6; i++) st1.push(i); while(!st1.isEmpty0) { int item = st1.pop(): if(item % 2 == 0) st2.push(item); while(ist2.isEmpty0) st1.push(st2.pop(); while(Ist1.isEmpty0) System.out.print(st1.pop() - "): 135 B 642 246 531

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 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. ? ? ??
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
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
public class arrayOutput { public static void main (String [] args) { final int NUM_ELEMENTS = 3; int[] userVals = new int [NUM_ELEMENTS]; int i; int sumVal; userVals [0] = 3; userVals [1] = 5; userVals [2] = 8; Type the program's output sumVal = 0; for (i = 0; i < userVals.length; ++i) { sumVal= sumVal + userVals [i]; System.out.println (sumVal); } ? ? ??
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.…
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 =…
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 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?
class ArrayStackException extends Exception {     ArrayStackException(String m) { super(m); }} public class ArrayStack { private int s[] = new int[100]; private int top=0;    public void push(int data) throws ArrayStackException { if (top>=s.length) throw new ArrayStackException("Push overflow: " + data); s[top]=data; top++; }     public int pop() throws ArrayStackException { if (top<=0) throw new ArrayStackException("Pop underflow: "); int value = s[top-1]; top--; return value; }     public int peek() { int value = s[top-1]; return value; }     public void clear() { top=0; }     public int size() { return top; }     public void display() { System.out.print( "size =" +top + ": "); for(int i =0; i<top;i++) { System.out.print( s[i] + " "); } System.out.println( ); }     public static void…
Enhanced selection sort algorithm 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…
getListRowIndices Method public static java.util.ArrayList<java.lang.Integer> getListRowIndices(int[][] array, int rowLength) This method returns an ArrayList with the indices of rows of the two-dimensional having a length that corresponds to rowLength. You may only use one auxiliary method. The method should create an ArrayList that is passed to the auxiliary in order to place the indices (if any). If no indices are found, an empty (size of 0) ArrayList will be returned. You can assume the array parameter will not be null and every row of the two-dimensional array has an array with a size of at least 0. Your implementation must be recursive and you may not use any loop construct. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: array - rowLength - Returns: ArrayList<Integer>
2D-DP-3 int getLowestFromArray(int myList[], int size) int i; int lowestIndex = 0; for (i = 1; i myList[i]) lowestIndex = i; return lowestIndex; int main() int cData[2][5] = {{12, 5, 4, 7, 8}, {6, 35, 3, 27, 8}}; int i, lowest; for (i = 0; i < 2; i++) lowest = printf("%d\n", lowest); return 0; Given the code segment above, what will be needed to complete the code above? Assume the necessary libraries and functions are included and implemented. Encoding Instructions: Write your answers with NO SPACES. Answers not accepted by automatic checking in AnimoSpace due to not complying with the encoding instructions will not be given considerations.