-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathMatrix_operations.java
More file actions
224 lines (213 loc) · 6.17 KB
/
Copy pathMatrix_operations.java
File metadata and controls
224 lines (213 loc) · 6.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
//Dat: 14/10/2021
//TO FIND DIFFERENT OPERATIONS ON MATRIX
import java.util.Scanner;
class matrix
{
int matrix[][]=new int[10][10];
int rows, columns;
boolean isUpperTriangular= true;
Scanner sc=new Scanner(System.in);
matrix()
{
rows=0;
columns=0;
}
matrix(int r, int c)
{
rows=r;
columns=c;
matrix=new int[rows][columns];
}
void create()
{
System.out.println("Enter no. of rows: ");
rows=sc.nextInt();
System.out.println("Enter no. of columns: ");
columns=sc.nextInt();
System.out.println("Enter the elements: ");
for(int i=0;i<rows;i++) {
for(int j=0;j<columns;j++) {
matrix[i][j]=sc.nextInt();
}
System.out.println("");
}
}
void display()
{
for(int i=0;i<rows;i++)
{
for(int j=0;j<columns;j++)
{
System.out.print("" +matrix[i][j]);
}
System.out.println();
}
}
void square_matrix()
{
if (rows==columns)
System.out.println("It is a square matrix");
else
System.out.println("It is not a square matrix");
}
void upper_triangular()
{
for(int i=0;i<rows;i++)
{
for(int j=0;j<i;j++)
{
if(matrix[i][j]!=0)
{
isUpperTriangular= false;
break;
}
if(!isUpperTriangular)
break;
}
}
if(isUpperTriangular)
System.out.println("It is upper triangular matrix");
else
System.out.println("It is not upper triangular matrix");
}
void add(matrix a)
{
if(a.rows==rows&&a.columns==columns)
{
int c[][]=new int[rows][columns];
for(int i=0;i<rows;i++)
{
for(int j=0;j<columns;j++)
{
c[i][j]=matrix[i][j]+a.matrix[i][j];
}
}
System.out.println("Addition of two matrices is: ");
for(int i=0;i<rows;i++)
{
for(int j=0;j<columns;j++)
{
System.out.println(""+c[i][j]);
}
System.out.println("");
}
}
else
System.out.println("Addition is not possible");
}
void multiplication(matrix a, matrix b)
{
int c[][]=new int[rows][columns];
if(a.rows==b.columns)
{
for(int i=0;i<rows;i++)
{
for(int j=0;j<columns;j++)
{
for(int t=0;t<a.rows;t++)
{
c[i][j]=+b.matrix[i][t]*a.matrix[t][j];
}
}
}
System.out.println("Multiplication is: ");
for(int i=0;i<rows;i++)
{
for(int j=0;j<rows;j++)
{
System.out.println(""+c[i][j]);
}
System.out.println("");
}
}
else
System.out.println("Multiplication is not possible");
}
void transpose()
{
int trans[][]=new int[columns][rows];
for(int i=0;i<rows;i++)
{
for(int j=0;j<columns;j++)
{
trans[j][i]=matrix[i][j];
}
}
System.out.println("\nTranspose is: \n");
for(int i=0;i<columns;i++)
{
for(int j=0;j<rows;j++)
{
System.out.println(""+trans[i][j]);
}
System.out.println();
}
}
}
public class Main
{
public static void main(String[] args)
{
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
matrix a=new matrix();
matrix b=new matrix();
int ch;
do {
System.out.println("1.Create a matrix");
System.out.println("2.Display a matrix");
System.out.println("3.Check if it is a square matrix");
System.out.println("4.Check if it is a upper triangular matrix");
System.out.println("5.Addition of a matrix");
System.out.println("6.Multiplication of a matrix");
System.out.println("7.Transpose of a matrix");
System.out.println("8.Exit");
System.out.println("Enter your choice: ");
ch=sc.nextInt();
switch(ch)
{
case 1:
System.out.println("Matrix 1. is: ");
a.create();
System.out.println("Matrix 2. is: ");
b.create();
break;
case 2:
System.out.println("Matrix 1. is: ");
a.display();
System.out.println("Matrix 2. is: ");
b.display();
break;
case 3:
System.out.println("Matrix 1: ");
a.square_matrix();
System.out.println("Matrix 2: ");
b.square_matrix();
break;
case 4:
System.out.println("Matrix 1. is: ");
a.upper_triangular();
System.out.println("Matrix 2. is: ");
b.upper_triangular();
break;
case 5:
System.out.println("Addition is: ");
a.add(b);
break;
case 6:
System.out.println("Multiplication is: ");
a.multiplication(a,b);
break;
case 7:
System.out.println("Matrix 1. is: ");
a.transpose();
System.out.println("Matrix 2. is: ");
b.transpose();
break;
case 8:
System.out.println("Exit program");
break;
}
}while(ch!=0);
}
}