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 outputuserVals [0] = 2;userVals [1] = 6;userVals [2] = 8;for (i = userVals.length - 1; i >= 0; −−1) {System.out.println(userVals [1]);}C.C.????

In computer programming, an array is a form of data structure used to group similar data types of…

Type the program's output public class arrayOutput ( public static void main (String [] args) { final int NUM_ELEMENTS = 3; int [] uservals = new int [NUM_ELEMENTS]; int i; uservals [0] 2; userVals [1] 6; userVals [2] 8; for (i = userVals.length - 1; 1 >= 0; --1) { System.out.println (userVals[1]); } C. ? ? ??

Type the program's output public class arrayOutput ( public static void main (String [] args) { final int NUM_ELEMENTS = 3; int [] uservals = new int [NUM_ELEMENTS]; int i; uservals [0] 2; userVals [1] 6; userVals [2] 8; for (i = userVals.length - 1; 1 >= 0; --1) { System.out.println (userVals[1]); } C. ? ? ??

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; 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); } ? ? ??
What sort algorithm is implemented in the sortArray1 method in the following program segment? *
public class array{public static void main(String args[]){int []arr = {1,2,3,4,5};System.out.println(arr[5]);}}a) 4b) 5c) ArrayIndexOutOfBoundsExceptiond) InavlidInputException
void changeAll(int x[]) { x[0] = x[0] + 5; return; The first element in an array would be increased by 5 The array would be the same because it was passed by value x would be increased by 5 All the elements in the passed array would be incremented by 5
What sort algorithm is implemented in the sortArray2 method in the following program segment? *
Assume that the following program segment is executed. What is the last element of testArray2 after the execution of the statement sortArray1(testArray2);? *
classHighArrayApp { public static void main(String[] args) { intmaxSize=100;// array size HighArrayarr;// reference to array arr=newHighArray(maxSize);// create the array arr.insert(77);// insert 10 items arr.insert(99); arr.insert(44); arr.insert(55); arr.insert(22); arr.insert(88); arr.insert(11); arr.insert(00); arr.insert(66); arr.insert(33); arr.display();// display items intsearchKey=35;// search for item if(arr.find(searchKey)) System.out.println("Found " + searchKey); else System.out.println("Can’t find " + searchKey); arr.delete(00);// delete 3 items arr.delete(55); arr.delete(99); arr.display();// display items again }// end main() }// end class HighArrayApp // highArray.java // demonstrates array class with high-level interface // to run this program: C>java HighArrayApp //////////////////////////////////////////////////////////////// class HighArray { private long[] a; // ref to array a private int nElems; // number of data items…
void shiftLeft(int array[], int size, int& numUsed, int index) { index = array[0]; for(int i = 1; i <= size - 1; i++) { array[i - 1] = array[i]; } array[size-1] = index; } void shiftRight(int array[], int size, int& numUsed, int index) { index = array[numUsed-1]; for(int i = numUsed - 2; i >= 0; i--) { array[i + 1] = array[i]; } array[0] = index; } how do i fix my shift right function.
class Main { // this function will return the number elements in the given range public static int getCountInRange(int[] array, int lower, int upper) { int count = 0; // to count the numbers // this loop will count the numbers in the range for (int i = 0; i < array.length; i++) { // if element is in the range if (array[i] >= lower && array[i] <= upper) count++; } return count; } public static void main(String[] args) { // array int array[] = {1,2,3,4,5,6,7,8,9,0}; // ower and upper range int lower = 1, upper = 9; // throwing an exception…
interface IResit { int row = 5; int col = 3; int upperBound = 10; public int[][] initTable(); // initialize 5x3 table with random (upper bound is:10) integer // numbers. “table” is class variable public int[] convertTwoToOne(int[][] a); // convert a two dimensional array into one dimensional // array /* * for example: * a= 1 3 5 * 6 9 -6 * 2 7 4 * * Your method should return: * 4 7 2 -6 9 6 5 3 1 * */ public double averageOfOddElements(int[] a); public double averageOfEvenElements(int[][] a); }// end of the interface /* Write a class that implements the given interface above. 1. Your class should have two constructors: 1. Default constructor: In this case, row, column and upper bound are same as the data that defined in the interface. 2. Overloaded constructor: in this case it should get three parameters, row, column, upper bound respectively. 2. Your constructor parameters are…
void showArray ( int a[ ], int size ); // shows the array in the format "int a [ ] = { 3, 7, 4, ... ,5, 6, 3} void showReverse ( int a[ ], int size ); // shows the array in reverse "int a [ ] = { 3, 6, 5, ... , 4, 7, 3 } " int lowest ( int a[ ], int size ); // finds and returns the lowest value in the array (should be 3) int highest ( int a[ ], int size ); // finds and returns the highest value in the array (should be 7) int sumArray ( int a[ ], int size ); // calculates and returns the sum of all values in the array float averageVal ( int a[ ], int size ); // calculates and returns the average of all values in the array int count5 ( int a[ ], int size ); // returns how many times the number 5 appears in the array int firstMinusLast ( int a[ ], int size ); // returns the difference b/w the First and Last Array Element void showBeforeIndex( int a [ ], int index); // shows all array values before a specific index void done…
Debug Program3: int element(int arr[], int num) { in i, ele; ele = arr[0]; for (i = 1; i < num; i++) if (arr[i] > ele) ele = arr[i]; return ele; } main() { arr[] = {1, 24, 145, 20, 8, -101, 300}; int n = sizeof(arr)/sizeof(arr[0]); printf("element of array is %d", element(arr[], n)); } 24 145 -101 300 Program4: main() { int m,n; for(i 0; i << 5; i++) { printf("\t\t\t\t"); for(j 0; j << 5; j+++) printf("*"); printf("/n"); } Program 5: int func(int) main() { int num = 7, c; int f= func(num); printf("\n\n%d of %d\n\n", num, f); } int func(aj); { if(aj=1 aj=0) return 1; else return (aj*fun(aj-1); } 49 5040 7117 none of…