Write a method that sums all the numbers in the major diagonal in an n x n matrix of double values using the following header: public static double sumMajorDiagonal(double[][] m) Write a test program that first prompts the user to enter the dimension n of an n x n matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix.

Write a method that sums all the numbers in the major diagonal in an n x n matrix of double values using the following header: public static double sumMajorDiagonal(double[][] m) Write a test program that first prompts the user to enter the dimension n of an n x n matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). The program should then print out the sum of the major diagonal of the matrix.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Please use java programming and add comment on each line Thank you!
Java Program Problem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. See all rows’, columns’ and diagonal’s sum is same. Write a main method where first you need to input n. Then input n*n integers and form a 2D matrix. Print “YES” if the matrix is magic square and print “NO” Otherwise. Sample input: 3 2 7 6 9 5 1 4 3 8
Java Script with the following: -Declare an n x n matrix of double values. -Write a method that sums all the numbers in the major diagonal using the following header:public static double sumMajorDiagonal(double[][] m)-Write a test program/main method that first prompts the user to enter the dimension n of an n x n matrix, then asks them to enter the matrix row by row (with the elements separated by spaces). -The program should then print out the sum. of the major diagonal of the matrix. -After finding the summation fill the elements of the major diagonal with the numbers 1 to n and print the new array.
Task 01: Assume P(x,y) is (x+y>4). Write a function/method that can validate the nested quantifier Vy P(x,y) for elements from two arrays X and Y. i. hint: The method returns l if statement is valid (the sum of all pairs of values from X and Y is greater than 4), and returns 0 otherwise. Valid case: For arrays X={2,3,4} and Y={3,4,5), the method returns 1(since xEX and býyEY, xi+y>4) Invalid case: For arrays X={2,3,4} and Y={1,4.5}, the method returns 0 (since 2EX and l EY but 2+1<4)
Write a program that prompts the user to enter the length of a square matrix, randomly fills in 0s and 1s into the matrix, prints the matrix, and finds the rows, columns, and major diagonal with all 0s or all 1s.
Write the following methodthat tests whether the array has four consecutive numbers with the same value:public static boolean isConsecutiveFour(int[] values)Write a test program that prompts the user to enter a series of integers and displaysit if the series contains four consecutive numbers with the same value. Yourprogram should first prompt the user to enter the input size—i.e., the number ofvalues in the series. Here are sample runs: Enter the number of values: 8↵EnterEnter the values: 3 4 5 5 5 5 4 5↵EnterThe list has consecutive foursEnter the number of values: 9↵EnterEnter the values: 3 4 5 5 6 5 5 4 5↵EnterThe list has no consecutive fours
TASK 1 Write a Java method that returns the index of the smallest element in an array of integers. If the number of such elements is greater than 1, return the smallest index. Use the following header: public static int indexofLargestlestelement(double[] array) Write a test program that prompts the user to enter ten numbers, invokes this method to return the index of the smallest element, and displays the index.
Problem 1: Complete the sumOfDiagonals method in SumOfDiagonals.java to do the following: 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 major diagonal of the array x. In order to have a major diagonal, the array passed into the 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 Not just use the Exception class to handle all exceptions in one catch block). Make the proper calls to the sumOfDiagonals method from the main method to test your sumOfDiagonals method on all the String arrays provided in the main method.
The two-dimensional arrays m1 and m2 are strictlyidentical if their corresponding elements are equal. Write a method that returnstrue if m1 and m2 are strictly identical, using the following header:public static boolean equals(int[][] m1, int[][] m2)Write a test program that prompts the user to enter two 3 x3 arrays of integersand displays whether the two are strictly identical.
i need to make sure for the answer Q2 java
The solution must be recursive. inputAndPrintReverse:Inputs integers from the user until the user enters 0, then prints the integers in reverse order. For this method, you may NOT use an array or any type of array structure, in other words, you may not use any structure to store the user input.
Write a Java program to display a three_month delivery report for three different years. The following rows and columns represents the deliveries made for each year Jan Feb Mar DELIVERIES 2018 128 135 139 DELIVERIES 2019 155 129 175 DELIVERIES 2020 129 130 185 Use a Two-Dimensional array, produce the deliveries report, including the deliveries made statistics. The deliveries made statistic must display the total, maximum and minimum deliveries made in the two-dimensional array.