Professional Documents
Culture Documents
import java.io.*;
class matrix
{
public static void main()throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int sum=0,f=0;
int r,y,c,k=0,pr=1,mid1,mid2,t,s1=0,s2=0;
System.out.println("Enter number of rows and columns");
r=Integer.parseInt(br.readLine());
c=Integer.parseInt(br.readLine());
int M[][]=new int[r][c];
int T[][]=new int[c][r];
int a[]=new int[r*c];
if((r*c)%4==0)
y=(r*c)/4;
else y=(r*c)/4 + 1;
int M2[][]=new int [4][y];
for(int i=0;i<r;i++)
{ System.out.println("Enter element for row "+(i+1));
for(int j=0;j<c;j++)
{
M[i][j]=Integer.parseInt(br.readLine());
}
}
System.out.println("Printing the matrix IN TABULAR FORMAT");
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
System.out.print(M[i][j]+" ");
System.out.println();
}//PRINTING IT IN TABULAR FORMAT
System.out.println("PRINTING THE TRANSPOSED MATRIX");
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
T[j][i]=M[i][j];
}
for(int i=0;i<c;i++)
{
for(int j=0;j<r;j++)
System.out.print(T[i][j]+" ");
System.out.println();
}
if(r==c)
{
for( int i=0;i<r;i++)
{
for( int j=0;j<c;j++)
{
if(M[i][j]!=M[j][i])
k=1;
}
}
if(k==0)
System.out.println("It is a symmetric matrix");
else
System.out.println("it is not a symmetric matrix");
}
else
System.out.println("Matrix is not a square matrix");
if(r==c)
{
System.out.println("Printing the left diagonal");
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
if(i==j)
System.out.print(M[i][j]);
else System.out.print(" ");
}
System.out.println();
}
}
else System.out.println("Left diagonal cannot be printed");
if(r==c)
{
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{if((i+j)==(r-1))
sum=sum+M[i][j];
}
}
System.out.println("SUM of the elements of the right diagonal is ="+sum);
}
else System.out.println("It is not Square Matrix");
sum=0;
System.out.println();
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
T[j][i]=M[i][j];
}
for(int i=0;i<c;i++)
{
for(int j=0;j<r;j++)
System.out.print(T[i][j]+" ");
System.out.println();
}
System.out.println("PRINTING CUMMULATIVE PRODUCTS of 2nd ROW ELEMENTS");
for(int i=0;i<r;i++)
{for(int j=0;j<c;j++)
{ if(i==1)
pr=pr*M[i][j];
}
}
System.out.println(pr);
System.out.println("PRINTING THE MATRIX IN SUCH A WAY THAT SUM OF EVERY ROW
APPEARS AT THE END OF RESPECTIVE ROW");
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
System.out.print(M[i][j]+" ");
sum=sum+M[i][j];
}
System.out.print(" "+sum);
sum=0;
System.out.println();
}
System.out.println("\nPRINTING THE MATRIX IN SUCH A WAY THAT SUM OF EVERY COLUMN
APPEARS AT THE BOTTOM OF RESPECTIVE COLUMN");
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
a[j]+=T[j][i];
System.out.print(M[i][j]+" ");
}
System.out.println();
}
System.out.println();
for(int j=0;j<c;j++)
System.out.print(a[j]+" ");