aadit/MIT-Curricular
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add OOP/Java/Lab/Week4/MatrixMulp.java

Browse Source
This commit is contained in:
Aadit Agrawal 2024-08-31 01:24:00 +05:30
parent 1ccf575914
commit dfc539c64c
1 changed files with 70 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

70
OOP/Java/Lab/Week4/MatrixMulp.java Normal file
View File

@ -0,0 +1,70 @@
import java.util.Scanner;
class MatrixMulp {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println(
"Enter the number of rows and columns in the matrix A: "
);
int m = sc.nextInt();
int n = sc.nextInt();
System.out.println(
"Enter the number of rows and columns in the matrix B: "
);
int p = sc.nextInt();
int q = sc.nextInt();
System.out.println(
"Matrices are " +
((m == p && n == q) ? "" : "not ") +
"compatible for addition."
);
System.out.println(
"Matrices are " +
((n == p) ? "" : "not ") +
"compatible for multiplication."
);
int[][] A = new int[m][n];
int[][] B = new int[p][q];
System.out.println("Enter the elements of matrix A:");
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
A[i][j] = sc.nextInt();
}
}
System.out.println("Enter the elements of matrix B:");
for (int i = 0; i < p; i++) {
for (int j = 0; j < q; j++) {
B[i][j] = sc.nextInt();
}
}
if (m == p && n == q) {
int[][] C = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
C[i][j] = A[i][j] + B[i][j];
}
}
System.out.println("Result of addition:");
printMatrix(C);
}
if (n == p) {
int[][] D = new int[m][q];
for (int i = 0; i < m; i++) {
for (int j = 0; j < q; j++) {
for (int k = 0; k < n; k++) {
D[i][j] += A[i][k] * B[k][j];
}
}
}
System.out.println("Result of multiplication:");
printMatrix(D);
}
}
}