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 homework instructions }} Complete the sumOfDiagonals method in SumOfDiagonals.java to do thefollowing:The method takes a 2D String array x as a parameter and returns no value.The method should calculate and print the sum of the elements on the majordiagonal of the array x.-In order to have a major diagonal, the array passed into the method shouldbe a square (n-by-n), if it's not a square your program should handle thatsituation 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 majordiagonal, your program should handle that situation by throwing anexception.When handling the exceptions, be as specific as you can be, (i.e. Do Not justuse the Exception class to handle all exceptions in one catch block).Make the proper calls to the sumOfDiagonals method from the mainmethod to test your sumOfDiagonals method on all the String arraysprovided in the main method.Sample runs provided on the next page. Argument Array x{{"2", "3", "4"},{"5", "6", "7"},{"8", "9" "10"}}ر{{"1", "2", "3"},{"5", "6", "7"},{"9", "10", "11"},{"13", "14", "15"}};{{"1", "2", "3", "4"},{"5", "6", "7", "8"},{"9", "10", "11", "12"},{"13", "14", "15", "pp"}};{{"1", "2", "3", "4"},{"5", "6", "7", "8"},{"9", "10", "11", "12"},{"13", "14", "15", "16"}};Output18Array not a squareNot a valid integer34

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 homework instructions } }

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 homework instructions } }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

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
2. Rotate Left k cells Use Python Consider an array named source. Write a method/function named rotateLeft( source, k) that rotates all the elements of the source array to the left by 'k' positions. You must execute the method by passing an array and number of cells to be shifted. After calling the method, print the array to show whether the elements have been shifted properly. Example: source=[10,20,30,40,50,60] rotateLeft(source,3) After calling rotateLeft(source,3), printing the array should give the output as: [ 40, 50, 60, 10, 20, 30]
Pseudocode for Java code Write the algorithm in pseudocode for a method that accepts three parameters: an integer array, an integer representing the number of valid values in the array, and an integer representing a factor. The method will count the number of valid values in the array that are multiples of the factor and will return the count. There is a Java operator that might be very helpful in solving this problem. Testing Above problem: Assuming that the first two parameters are an array containing 4, 10, 15, 12, 8, 20, 100, 25, 32, 7, 28, and 48 and the number 12, come up with three good test cases for the factor and the return value. factor numMultiples
The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below. The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Project Specifications Input for this project: Values of the grid (row by row) Output for this project: Whether or not the grid is magic square Processing Requirements Use the following template to start your project: #include<iostream> using namespace std; // Global constants const int ROWS = 3; // The number of rows in the array const int COLS = 3; // The number of columns…
The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below. The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std; // Global constants const int ROWS = 3; // The number of rows in the array const int COLS = 3; // The number of columns in the array const int MIN = 1; // The value of the smallest number const int MAX = 9; // The value of the largest number //…
JAVAWrite a program that searches person's name and display all matched name. For example, if a user inputs the letter "Davis", the program searches all name which includes "Davis" in an array. Then, display all matched names on the screen. You must declare a single dimensional array which has all people’s name. Use methods of string class
Java Problem: Implementing a method to print a cell's neighbors on a 2D array. The method's header is provided. The main method (do not alter it)w ill read N numbers to create the 2D array and it will call the method for you. Do not go out of the bounds of the 2D array. I have attached what it should look like with the following input: 4 4 1 2 3 4 7 8 9 10 13 14 15 16 19 20 21 22 2 2 Code I have so far: import java.util.Arrays;import java.util.Scanner;public class Problem3 {public static void printNeighbours(int[][] data, int row, int col){}public static void main(String[] args) {Scanner kb = new Scanner(System.in);int[][] data = new int[kb.nextInt()][kb.nextInt()];for (int i = 0; i < data.length; i++) {for (int j = 0; j < data[0].length; j++) {data[i][j] = kb.nextInt();}}System.out.println("The 2D Array:");for (int[] cols : data) {System.out.println(Arrays.toString(cols));}int row = kb.nextInt();int col = kb.nextInt();System.out.printf("The centre point is: %d %d…
Java code Screenshot and output
Write a program that creates a 2-D array initialized with test data . Use any primitive type of data EXCEPT int (Integer). The program should have all methods in the problem. getTotal - This method should accept a two-dimensional array as its argument and return the total of all the values in the array. getAverage - This method should accept a two-dimensional array as its argument and return the average of all the values in the array. getRowTotal. - This method should accept a two-dimensional array as its first argument and an integer as its second argument. The second argument should be the subscript of a row in the array. The method should return the total of the values in the specified row. getColumnTotal - This method should accept a two-dimensional array as its First argument and an integer as its second argument. The second argument should be the subscript of a column in the array. The method should return the total of the values in the specified column.…
JAVA - Multi Dimensional Arrays Ask the user for the number of rows and columns of a two-dimensional array and then its integer elements. Print the row number of the row where the sum of all of its elements is even. For this problem, it is guaranteed that there is one and only one row of such case. Row count starts at 0. Input 1. One line containing an integer for the number of rows 2. One line containing an integer for the number of columns 3. Multiple lines containing at least one integer each line for the elements of the array Sample 2 7 4 1 1 2 0 5 0 Output Note that the row number starts at 0, not 1. Enter # of rows: 3 Enter # of columns: 3 Enter elements: 2 7 4 1 1 2 0 5 0 Even row: 1
java note: matrices refers to 2D arrays
Description Write a Java program, called LinearSearch1 that contains a static method called findElement() that accepts a double array and a double as its parameters and return a boolean value if the double number entered is contained in the double array. In the main method you should use user input to take the element you wish to search for in the array. There is code there for your array, DO NOT CHANGE THIS CODE. Your program should call findElement() to check for the occurence of the double number entered in the array. You should print an appropriate message to the screen if the element is found. Output A message stating if the element is found. Sample Input 1 678.954 Sample Array 1 345.6 678.954 234.534 -89.23 Sample Output 1 678.954 was found in the array Sample Input 2 65.45 Sample Array 2 345.6 678.954 234.534 -89.23 Sample Output 2 65.45 was NOT found in the array