use java 1 public class Sum extends ConsoleProgram2- {public void run(){int[][] array = {{32, 4, 14, 65, 23, 6},34 -{4, 2, 53, 31, 765, 34},{64235, 23, 522, 124, 42}};7}public static int sumRow(int[][] array, int row){1011 -12}14 }1315 Write the methodpublic static int sumRow(int[]] array, int row)that sums row row in the 2D array called array .Then, traverse array to print the sum of each row in the 2D array.

Name: use java 1 public class Sum extends ConsoleProgram2- {public void run(
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: use java 1 public class Sum extends ConsoleProgram2- {public void run(){int[][] array = {{32, 4, 14, 65, 23, 6},34 -{4, 2, 53, 31, 765, 34},{64235, 23, 522, 124, 42}};7}public static int sumRow(int[][] array, int row){1011 -12}14 }1315 Write the meth

Answered: þublic class sum extends ConsoleProgram…

Engineering

Computer Science

þublic class sum extends ConsoleProgram { public void run() { int[][] array = {{32, 4, 14, 65, 23, 6}, {4, 2, 53, 31, 765, 34}, {64235, 23, 522, 124, 42}}; }

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

// MergeSortTest.java// Sorting an array with merge sort.import java.security.SecureRandom;import java.util.Arrays; public class MergeSortTest { // calls recursive sortArray method to begin merge sorting public static void mergeSort(int[] data) { sortArray(data, 0, data.length - 1); // sort entire array } // splits array, sorts subarrays and merges subarrays into sorted array private static void sortArray(int[] data, int low, int high) { // test base case; size of array equals 1 if ((high - low) >= 1) { // if not base case int middle1 = (low + high) / 2; // calculate middle of array int middle2 = middle1 + 1; // calculate next element over // split array in half; sort each half (recursive calls) sortArray(data, low, middle1); // first half of array sortArray(data, middle2, high); // second half of array // merge two sorted arrays after split calls…
Complete this code in Java import java.util.Scanner; import java.util.ArrayList; public class SET { ArrayListlist; int length; public SET(); { list=new ArrayList<>(10); length=0; } public SET(int cap) { list=new arrayList<>(cap); length=0; } public int getLength() { return length; } } public class SetApplication { public static void main(String[] args) { SET st=new SET(); System.out.println(st.getLength()); } }
Problem (class MergeSalary)First, write a Java method merge that takes as parameter a non-empty double array representingemployees’ salaries. The method merges the values of every 2 adjacent elements. put themerged values at the beginning of the array, and put 0 in the remaining positions. Suppose thatthe original array will contain an even number of elements.Second, write two java methods readArray(int[]a) and printArray(int[]a) thatreads/writes the elements of an array passed in parameter from/to the standard input/output.Finally, Use the following main method to test your different methods:public class MergeSalary{ private static Scanner input = new Scanner(System.in); public static void main(String[] args) { double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); }}
import java.util.*;class Arraylist{public static void main(String args[]){ArrayList obj = new ArrayList();obj.add("A");obj.add("B");obj.add("C");obj.add(1, "D");System.out.println(obj);}} What will the given code prints on the output screen.
Write Java statements to add the integers 1001, 1100, and 1110 to the resulting ArrayList import java.util.*;public class test { public static void main(String[] args) { //Set n =25 int n = 25; //ArrayList of Integer type with size,n=25 ArrayList<Integer> list = new ArrayList<Integer>(n); for(int i = 0;i<n;i++){ //Assign -1 to all the objects of the array list,list list.add(-1); } //Add 1001 to the list list.add(1001); //Add 1100 to the list list.add(1100); //Add 1110 to the list list.add(1110); //Reset the number of elements in the list becomes 28 //Use size() method to get the size of the list. n=list.size(); //for loop to print the list for(int i = 0;i<n;i++){ System.out.print(list.get(i) + " "); } }} 1. Write the Java statement to display the size of the resulting ArrayList from above.
JAVA PROGRAMMING I need an expert to write Test application to run the MyArrayStack<T> class. import java.util.Arrays; interface MyStack<T> {public void push(T o);public T pop() throws StackEmptyException;public T peek();public boolean isEmpty();public int size();} class MyArrayStack<T> implements MyStack<T>{private static final int DEFAULT_STACK_SIZE = 100;T[] stackArray;int top = 0; public MyArrayStack() {this(DEFAULT_STACK_SIZE);}public MyArrayStack(int defaultSize) {top = 0;stackArray = (T[])new Object[defaultSize];} public void push(T o) {if (size() == stackArray.length) expandCapacity();stackArray[top] = o;top++;}private void expandCapacity() {stackArray = Arrays.copyOf(stackArray, stackArray.length*2);System.out.println("StackArray size is automatically expanded:" + stackArray.length);} public T pop() throws StackEmptyException {if (isEmpty()) throw new StackEmptyException("Stack is empty");top--;T o = stackArray[top];stackArray[top] = null;return o;}…
import java.util.Scanner; public class ModifyArray { public swapArrayEnds(10, 20, 30, 40) { for (i = 0; i < (arrVals.length / 2); ++i) { tempValue = arrVals[i]; // Do swap //*please fix code// arrVals[i] = arrVals[arrVals.length - 1 - i]; arrVals[arrVals.length - 1 - i] = tempValue; Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. public static void main (String [] args) { Scanner scnr = new Scanner(System.in); int numElem = 4; int[] sortArray = new int[numElem]; int i; int userNum; for (i = 0; i < sortArray.length; ++i) { sortArray[i] = scnr.nextInt(); } swapArrayEnds(sortArray); for (i = 0; i < sortArray.length; ++i) { System.out.print(sortArray[i]); System.out.print(" "); } System.out.println(""); }}
code: import java.util.Random;import java.util.ArrayList;import java.util.Scanner;public class WeekendOrders {/*** * This method takes as input the scanner instance created from main and* asks the user for input on the number of orders placed on each of the * days on the long weekend (Saturday, Sunday, and Monday). * Put the number of orders for each day in an array of fixed size* * * @param scnr (an instance of Scanner)* @return an array of int which includes the number of orders* placed on each day, with one day per index of the array*/public static int[] getUserInput(Scanner scnr){// DO NOT MODIFY THIS LINEint[] userInput = new int[3];// TODO: Prompt user for input on number of orders on each day// and store in userInputreturn userInput; }/*** * This method appends all the new orders for the given day onto the * arraylist. It first generates a random int between 0-2 (inclusive).* If the int is 0: it adds "Burger" to the prevOrders list* If the int is 1: it adds "Fries" to the…
Create Test Suit for all test cases public class Arraymethod { public static void main(String[] args) { int [] array = {2,5,10,8,9,3}; System.out.println("Sum of array elements is:"+sum(array)); System.out.println("Average of array elements is:"+avg(array)); System.out.println("Maximum element of array is:"+max(array)); System.out.println("Minimum element of array is:"+min(array)); } //method for calculating sum of array elements public static int sum(int[] array) { int sum = 0; for(int i=0; i array[i]) { min = array[i]; } } return min; } } Create Test Suit for all test cases
package edu.umsl.iterator;import java.util.ArrayList;import java.util.Arrays;import java.util.Collection;import java.util.Iterator;public class Main {public static void main(String[] args) {String[] cities = {"New York", "Atlanta", "Dallas", "Madison"};Collection<String> stringCollection = new ArrayList<>(Arrays.asList(cities));Iterator<String> iterator = stringCollection.iterator();while (iterator.hasNext()) {System.out.println(/* Fill in here */);}}} Rewrite the while loop to print out the collection using an iterator. Group of answer choices iterator.toString() iterator.getClass(java.lang.String) iterator.remove() iterator.next()
Java: Use array class. Thanks!
import java.util.Arrays; import java.util.Random; public class Main { public void Start(){ int[] array = {3, 6, 1, 4, 2, 9, 7, 8, 5, 0}; int key = 1; Arrays.sort(array); //sort array int result = binarySearch(array,key); //Print values in array after sort System.out.println(result); } int binarySearch(int arr[], int key){ // put your code here. } public static void main(String[] args) { Main main = new Main(); main.Start(); } } --------------------------------------------------------------------------------------------------------------------------------------------------------- Given a sorted array named arr of n elements, write a function to search for a given element x in arr. If the element is present, return the index of x in the array. If the element is not present, return -1. Don't forget that arrays are 0-base-indexed, meaning that the first element in…