Problem 1:Complete the sumOfDiagonalsmethod in SumOfDiagonals.javato do the following:-The method takes a 2D Stringarray xas a parameter and returns no value.-The method should calculate and print the sum of the elements on the major diagonal of the array x.-In order to have a major diagonal, the array passed intothe method should be a square (n-by-n),if it’s not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays)-If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception.-When handling the exceptions, be as specific as you can be, (i.e. Do Notjust use the Exceptionclass to handle all exceptions in one catch block).-Make the proper calls to the sumOfDiagonalsmethod from the main method to test your sumOfDiagonalsmethod on all the String arrays provided in the main method.-Sample runs provided on the next page

Problem 1:Complete the sumOfDiagonalsmethod in SumOfDiagonals.javato do the following:-The method takes a 2D Stringarray xas a parameter and returns no value.-The method should calculate and print the sum of the elements on the major diagonal of the array x.-In order to have a major diagonal, the array passed intothe method should be a square (n-by-n),if it’s not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays)-If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception.-When handling the exceptions, be as specific as you can be, (i.e. Do Notjust use the Exceptionclass to handle all exceptions in one catch block).-Make the proper calls to the sumOfDiagonalsmethod from the main method to test your sumOfDiagonalsmethod on all the String arrays provided in the main method.-Sample runs provided on the next page

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter14: Files And Streams

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write an application that displays the strings in the provided array alphabetically in ascending order import java.util.*; public class StringSort { public static void main(String[] args) { String[] values = {"mouse", "dog", "cat", "horse", "cow", "moose", "tiger", "lion", "elephant", "bird", "hamster", "guinea pig", "leopard", "aardvark", "hummingbird"}; } } I need help with this!
Find the index of the first negative numberIntegerListUtils.java import java.util.ArrayList; public class IntegerListUtils { /** * Finds the index of the first negative number in the list. * * @param numbers a list of integers * @return the index of the first negative number, or -1 if no negative number found */ public static int findIndexOfFirstNegative(ArrayList<Integer> numbers) { // complete this method }}
public class SumOfDiagonals { public static void main(String[] args) { String[][] s1 = {{"2", "3", "4"}, {"5", "6", "7"}, {"8", "9", "10"}}; String[][] s2 = {{"1", "2", "3"}, {"5", "6", "7"}, {"9", "10", "11"}, {"13", "14", "15"}}; String[][] s3 = {{"1", "2", "3", "4"}, {"5", "6", "7", "8"}, {"9", "10", "11", "12"}, {"13", "14", "15", "16"}}; try { sumOfDiagonals(s1); sumOfDiagonals(s2); sumOfDiagonals(s3); } catch(NumberFormatException ex) { System.out.println("Not a valid integer"); } catch(IllegalArgumentException ex) { System.out.println("Array not a square"); } } public static void sumOfDiagonals(String[][] x) { //TODO Complete this method as required in the…
java The search method accepts ArrayList of Strings and String find. The method returns a String. It will look for an element within ArrayList that contains value of find if it finds it, methods needs to return whole Element value. if an instance of find doesn't exist return:"search failed" Example: search(["one apple","two orange","four banana"],"four") returns: "four banana" ("four banana" contains "four" so method returns "four banana")
Write an application that displays the strings in the provided array alphabetically in ascending order. import java.util.*; public class StringSort { publicstaticvoidmain(String[] args) { String[] values = {"mouse","dog","cat","horse","cow", "moose","tiger","lion","elephant","bird","hamster", "guinea pig","leopard","aardvark","hummingbird"}; }
For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, mport java.util.Scanner; public class Compare { public static void main(String args[]) {final int SIZE_LIST = 4;int[] keysList = new int[SIZE_LIST];int[] itemsList = new int[SIZE_LIST];int i;Scanner input = new Scanner(System.in); keysList[0] = input.nextInt();keysList[1] = input.nextInt();keysList[2] = input.nextInt();keysList[3] = input.nextInt(); itemsList[0] = input.nextInt();itemsList[1] = input.nextInt();itemsList[2] = input.nextInt();itemsList[3] = input.nextInt(); /* Your code goes here */ System.out.println();} }
For any element in keysList with a value greater than 40, print the corresponding value in itemsList, followed by a semicolon (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20;30; import java.util.Scanner; public class Compare { public static void main(String args[]) {final int SIZE_LIST = 4;int[] keysList = new int[SIZE_LIST];int[] itemsList = new int[SIZE_LIST];int i;Scanner input = new Scanner(System.in); keysList[0] = input.nextInt();keysList[1] = input.nextInt();keysList[2] = input.nextInt();keysList[3] = input.nextInt(); itemsList[0] = input.nextInt();itemsList[1] = input.nextInt();itemsList[2] = input.nextInt();itemsList[3] = input.nextInt(); /* Your code goes here */ System.out.println();} }
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?
Make the code output sentence starts with a capitalization, and ends with a period. public class Word implements IWord{ private String word; public Word(String word){ this.word = word; } @Override public String getWord(){ return word; }} public class CompoundWord implements IWord { private IWord word1; private IWord word2; public CompoundWord(IWord w1, IWord w2){ word1 = w1; word2 = w2; } @Override public String getWord(){ return word1.getWord() + word2.getWord(); } } import java.util.ArrayList;public class Sentence { private ArrayList<IWord> words; public Sentence(){ words = new ArrayList<IWord>(); } public Sentence add(IWord word){ words.add(word); return this; } public String getSentence(){ String result = ""; for(IWord word:words) result += word.getWord()+" "; return…
Data structure & Algorithum java program 1) Add a constructor to the class "AList" that creates a list from a given array of objects.2) Add a method "getPosition" to the "AList" class that returns the position of a given object in the list. The header of the method is as follows : public int getPosition(T anObject)3) Write a program that thoroughly tests all the methods in the class "AList".4) Include comments to all source code.
private static final List<Polynomial> polyList = new ArrayList<>(); //main here public static void main(String[] args) { processPolyList(); } //=============================================================================================== // method: fromFile / returns: Arraylist // description: Opens a file takes a String and tokenizes it into an ArrayList of of expressions //=============================================================================================== public static ArrayList<String> f
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