Problem 1: File Name: Matrix.java Class Name: Matrix Problem Description: Write a program to perform the following operations on the two-dimension array: 1. Capture input for Matrix 1 and Matrix 2 from user 2. Print Matrix 1 and Matrix 2 3. Add Matrix 1 and Matrix 2 and store the result in Matrix 3 4. Find the largest number from the Matrix 3 5. Exit Guidelines: 1. Use switch case and while loop. 2. Variables to declare in the main method- matrix1, matrix2, matrix3 3. Use methods to write each operation listed in problem description and pass two- dimension array i.e. matrix as an argument to methods. Steps to follow: 1. Capture the dimension if N * N matrix from user 2. Declare and Initialize both matrix1 and matrix2 using the dimension. 3. Display array operations 4. Input user choice 5. Use the switch case to call the appropriate method 4. Implement the methods in your program for all operations listed in the problem description 6. Loop again to display array operations. Provide and exit the loop (hint: use return statement) Sample Output: Enter the dimension for the N*N matrix: 3 Operations 1. Read Matrix input: 2. Print Matrix: 3. Matrix addition 4. Largest number 5. Exit Enter your choice: 1 Read Matrix : 1 2 3 5 8 Read Matrix : 2 3
Please use Java programming language and add comments in the code. Thanks!! :)
Sample Output:
Enter the dimension for the N*N matrix: 3
Operations
1. Read Matrix input:
2. Print Matrix:
3. Matrix addition
4. Largest number
5. Exit
Enter your choice: 1
Read Matrix : 1
1
2
3
4
5
6
7
8
9
Read Matrix : 2
1
2
3
4
5
6
7
8
9
Operations
1. Read Matrix input:
2. Print Matrix:
3. Matrix addition
4. Largest number
5. Exit
Enter your choice: 2
Matrix - 1
1 2 3
4 5 6
7 8 9
Matrix - 2
1 2 3
4 5 6
7 8 9
Operations
1. Read Matrix input:
2. Print Matrix:
3. Matrix addition
4. Largest number
5. Exit
Enter your choice: 3
Matrix - 3
2 4 6
8 10 12
14 16 18
Operations
1. Read Matrix input:
2. Print Matrix:
3. Matrix addition
4. Largest number
5. Exit
Enter your choice: 4
Largest number is:18
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images