KEMBAR78
Two Dimensional Array Programs | PDF | Matrix (Mathematics) | Linear Algebra
Scribd
Upload
6 views12 pages

Two Dimensional Array Programs

Uploaded by

rosiee5902167
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views12 pages

Two Dimensional Array Programs

Uploaded by

rosiee5902167
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 12

TWO DIMENSIONAL ARRAY PROGRAMS

SYNTAX
datatype arrayidentifier[][]=new datatype[column][row];
Number of rows: a.length
Number of columns: a[0].length
PROGRAM 1:
To accept elements in a two dimensional array and print the array elements.
import java.util.*;
class PROGRAM1
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number of rows and columns...");
int m=sc.nextInt();
int n=sc.nextInt();
int a[][]=new int[m][n];
int i,j;
System.out.println("Enter array elements");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
a[i][j]=sc.nextInt();
}
}
System.out.println("Elements are.............");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
}
}

PROGRAM 2:
To accept elements in a two dimensional array and print the sum of
array elements.
import java.util.*;
class PROGRAM2
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the size of the array....");
int n=sc.nextInt();
int a[][]=new int[n][n];
int i,j;
int sum=0;
System.out.println("Enter array elements");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
a[i][j]=sc.nextInt();
sum=sum+a[i][j];
}
}
System.out.println("Elements are.............");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
System.out.println("The sum of all the elements present in the array
"+sum);
}
}
PROGRAM 3:
TO FIND THE SUM OF EACH ROW AND SUM OF EACH COLUMN
import java.util.*;
class PROGRAM3
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the size of the array....");
int n=sc.nextInt();
int a[][]=new int[n][n];
int i,j;
int rsum=0,csum=0;
System.out.println("Enter array elements");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
a[i][j]=sc.nextInt();
}
}
System.out.println("Original array elements are.............");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
for(i=0;i<n;i++)
{
rsum=0;csum=0;
for(j=0;j<n;j++)
{
rsum=rsum+a[i][j];
csum=csum+a[j][i];
}
System.out.println("The sum of "+(i+1)+" row...."+rsum);
System.out.println("The sum of "+(i+1)+" column...."+csum);
}
}
}

PROGRAM 4:
SUM OF LEFT DIAGONAL AND RIGHT DIAGONAL
import java.util.*;
class PROGRAM4
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int lsum=0,rsum=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if(i==j)
lsum=lsum+a[i][j];
if(i+j==N-1)
rsum=rsum+a[i][j];
}
}
System.out.println("The sum of left diagonal...."+lsum);
System.out.println("The sum of right diagonal......"+rsum);
}
}

PROGRAM 5:
SUM OF BOUNDARY ELEMENTS AND NON BOUNDARY ELEMENTS
import java.util.*;
class PROGRAM5
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int sum1=0,sum2=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
a[i][j]=sc.nextInt();
}
}
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if(i==0||j==0||i==N-1||j==N-1)
sum1=sum1+a[i][j];
if(i!=0&&j!=0&&i!=N-1&&j!=N-1)
sum2=sum2+a[i][j];
}
}
System.out.println("The sum of boundary...."+sum1);
System.out.println("The sum of non boundary......"+sum2);
}
}
PROGRAM 6:
To accept elements in a two dimensional array and check whether it
is a sparse matrix.
class SPARSE
{
public static void main()
{
int a[][]={{0,4,0,5},{0,0,3,6},{0,0,2,0},{2,3,0,0},{0,0,0,0}};
int c=0,c1=0;
for(int i=0;i<a.length;i++)
{
for(int j=0;j<a[0].length;j++)
{
if(a[i][j]!=0)
c++;
else
c1++;
}
}
for(int i=0;i<a.length;i++)
{
for(int j=0;j<a[0].length;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
if(c1>c)
System.out.println("SPARSE MATRIX");
else
System.out.println("NOT SPARSE MATRIX");
}
}
PROGRAM 7:
LOWER TRIANGULAR MATRIX
import java.util.*;
class LOWER
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int lsum=0,rsum=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
int flag1=0,flag2=0;
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if(i<j && a[i][j]!=0)
flag1=1;
if(i>=j && a[i][j]==0)
flag2=1;
}
}
if(flag1==0 && flag2==0)
System.out.println("Lower triangular Matrix");
else
System.out.println("Not a Lower triangular Matrix");
}
}

PROGRAM 8:
SCALAR MATRIX
import java.util.*;
class SCALAR
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int lsum=0,rsum=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
int flag1=0,flag2=0;int t=a[0][0];
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if((i==j) && a[i][j]!=t)
flag1=1;
if((i!=j) && a[i][j]!=0)
flag2=1;
}
}
if(flag1==0 && flag2==0)
System.out.println("The Matrix is scalar");
else
System.out.println("The Matrix is not scalar");
}
}
PROGRAM 9:
UPPER TRIANGULAR MATRIX
import java.util.*;
class UPPER
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int lsum=0,rsum=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
int flag1=0,flag2=0;
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if(i<=j && a[i][j]==0)
flag1=1;
if(i>j && a[i][j]!=0)
flag2=1;
}
}
if(flag1==0 && flag2==0)
System.out.println("Upper triangular Matrix");
else
System.out.println("Not a Upper triangular Matrix");
}
}
PROGRAM 10:
SUM OF BOUNDARY AND NON BOUNDARY ELEMENTS
import java.util.*;
class PROGRAM5
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int sum1=0,sum2=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if(i==0||j==0||i==N-1||j==N-1)
sum1=sum1+a[i][j];
if(i!=0&&j!=0&&i!=N-1&&j!=N-1)
sum2=sum2+a[i][j];
}
}
System.out.println("The sum of boundary...."+sum1);
System.out.println("The sum of non boundary......"+sum2);
}
}
PROGRAM 11:
MIRROR MATRIX
import java.util.*;
class MIRROR
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("ORIGINAL MATRIX");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
System.out.println("MIRROR MATRIX");
for(i=0;i<N;i++)
{
for(j=N-1;j>=0;j--)
System.out.print(a[i][j]+"\t");
System.out.println();
}
}
}

PROGRAM 12:
TRANSPOSE MATRIX
import java.util.*;
class TRANSPOSE
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("ORIGINAL MATRIX");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
System.out.println("TRANSPOSE MATRIX");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[j][i]+"\t");
System.out.println();
}
}
}
TRANSPOSE MATRIX
import java.util.*;
class TRANSPOSE1
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int b[][]=new int[N][N];
int i,j;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
for(i=0;i<N;i++)
for(j=0;j<N;j++)
b[i][j]=a[j][i];
System.out.println("ORIGINAL MATRIX");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(a[i][j]+"\t");
System.out.println();
}
System.out.println("TRANSPOSE MATRIX");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
System.out.print(b[i][j]+"\t");
System.out.println();
}
}
}
PROGRAM 13:
IDENTITY MATRIX
import java.util.*;
class IDENTITY
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter array size....");
int N=sc.nextInt();
int a[][]=new int[N][N];
int i,j;
int lsum=0,rsum=0;
System.out.println("Enter array elements");
for(i=0;i<N;i++)
for(j=0;j<N;j++)
a[i][j]=sc.nextInt();
System.out.println("Elements are.............");
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
int flag1=0,flag2=0;
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
if((i==j) && a[i][j]!=1)
flag1=1;
if((i!=j) && a[i][j]!=0)
flag2=1;
}
}
if(flag1==0 && flag2==0)
System.out.println("IDENTITY MATRIX");
else
System.out.println("NOT AN IDENTITY MATRIX");
}
}

You might also like