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. Sample runs provided on the next page.
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. Sample runs provided on the next page.
Chapter8: Arrays
Section: Chapter Questions
Problem 17RQ
Related questions
Question
![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.
Sample runs provided on the next page.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F46019e4a-f0f0-48fb-afa2-89c17073743a%2Fb4df3360-5dd2-464f-a79b-b6ba16008798%2F9simbjl_processed.jpeg&w=3840&q=75)
Transcribed Image Text: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.
Sample runs provided on the next page.
![Argument Array x
{{"2", "3",
"4"},
{"5", "6", "7"},
{"8", "9" "10"}}
2
{{"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"}};
Output
18
Array not a square
Not a valid integer
34](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F46019e4a-f0f0-48fb-afa2-89c17073743a%2Fb4df3360-5dd2-464f-a79b-b6ba16008798%2Fzqsiaf_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Argument Array x
{{"2", "3",
"4"},
{"5", "6", "7"},
{"8", "9" "10"}}
2
{{"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"}};
Output
18
Array not a square
Not a valid integer
34
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 4 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
![EBK JAVA PROGRAMMING](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage