Scribd
Upload
4 views24 pages

Java Programs for Array Operations

The document contains multiple Java programs that perform various tasks such as finding maximum and minimum values, searching for elements, sorting arrays, and performing matrix operations. Each program utilizes the Scanner class for user input and demonstrates different algorithms like linear search, binary search, bubble sort, selection sort, and matrix addition. Additionally, it includes functionalities for identifying vowels, calculating sums, and checking for properties like symmetry and identity in matrices.

Uploaded by

lakshyajg1
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
4 views24 pages

Java Programs for Array Operations

The document contains multiple Java programs that perform various tasks such as finding maximum and minimum values, searching for elements, sorting arrays, and performing matrix operations. Each program utilizes the Scanner class for user input and demonstrates different algorithms like linear search, binary search, bubble sort, selection sort, and matrix addition. Additionally, it includes functionalities for identifying vowels, calculating sums, and checking for properties like symmetry and identity in matrices.

Uploaded by

lakshyajg1
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

import [Link].

*;

public class maxmin

public static void main()

Scanner input=new Scanner ([Link]);

int a[]=new int[10];

int max,min;

[Link]("Enter 10 values:");

for(int i=0; i<[Link]; i++)

a[i]=[Link]();

min=max=a[0];

for(int i=0; i<[Link]; i++)

if(a[i]>max)

max=a[i];

if(a[i]<min)

min=a[i];

[Link]("Max:"+max);

[Link]("Min:"+min);

import [Link].*;

import [Link].*;

public class linear

public static void main()

Scanner input=new Scanner ([Link]);


int a[]=new int[10];

boolean res=false;

int x;

[Link]("Enter 10 values:");

for(int i=0; i<[Link]; i++)

a[i]=[Link]();

[Link]("Enter required value:");

x=[Link]();

for(int i=0; i<[Link]; i++)

if(a[i]==x)

res=true;

if(res==true)

[Link]("The value is present");

else

[Link]("Value not present:");

import [Link].*;

public class binary

public static void main()

Scanner input=new Scanner ([Link]);

int a[]=new int[10];

int l,u,m;

int x;

l=0;

[Link]("Enter 10 values:");
for(int i=0; i<[Link]; i++)

a[i]=[Link]();

[Link]("Enter required value:");

x=[Link]();

u=[Link]-1;

while(u>=l)

m=(u+l)/2;

if(a[m]==x)

[Link]("Element found");

break;

if(a[m]>x)

u=m-1;

if(a[m]<x)

l=m+1;

public class bubble_sort

public static void main()

Scanner input= new Scanner ([Link]);

int a[]=new int[25];

int b=0;

[Link]("Enter 25 values:");

for(int i=0; i<[Link]; i++)


a[i]=[Link]();

for(int i=0; i<[Link]; i++)

for(int j=0; j<[Link]-i-1; j++)

if(a[j]>a[j+1])

b=a[j];

a[j]=a[j+1];

a[j+1]=b;

for(int i=0; i<[Link]; i++)

[Link](a[i]);

import [Link].*;

public class selection_sort

public static void main()

Scanner input= new Scanner ([Link]);

int a[]=new int[15];

int b=0;

[Link]("Enter 25 values:");

for(int i=0; i<[Link]; i++)

a[i]=[Link]();

for(int i=0; i<[Link]; i++)

{
int min=i;

for(int j=i+1; j<[Link]; j++)

if(a[j]<a[min])

min=j;

b=a[i];

a[i]=a[min];

a[min]=b;

for(int k=0; k<[Link]; k++)

[Link](a[k]);

import [Link].*;

public class vowelstart

public static void main()

Scanner input= new Scanner ([Link]);

String a[]=new String[30];

[Link]("Enter 30 words:");

for(int i=0; i<[Link]; i++)

a[i]=[Link]();

for(int i=0; i<[Link]; i++)

String b=a[i].toUpperCase();

char c=[Link](0);

if(c=='A'|| c=='E'||c=='I'||c=='O'||c=='U')
[Link](a[i]);

import [Link].*;

public class marksavg

public static void main()

Scanner input=new Scanner ([Link]);

int n=[Link]();

int a[]=new int[n];

import [Link].*;

public class pattern

public static void main()

Scanner input=new Scanner ([Link]);

int a=[Link]();

for(int i=0; i<=a;i++)

for(int j=0; j<=i; j++)

[Link](j+"\t");

[Link]();

}
}public class prime

public static void main()

Scanner input=new Scanner ([Link]);

int a[]=new int[10];

for(int i=0;i<[Link];i++)

a[i]=[Link]();

for(int i=0; i<[Link];i++)

int b=a[i];

int f=0;

for(int j=0;j<b;j++)

if(b/j==0)

f=f+1;

if(f>2)

[Link](a[i]);

import [Link].*;

public class Matrix

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int b[][]=new int[3][3];


int c[][]=new int[3][3];

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

b[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

c[i][j]=a[i][j]+b[i][j];

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

[Link](c[i][j]+"\t");

[Link]();

}
}

public class diagonaladd

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0,sum2=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(i==j)

sum=sum+a[i][j];

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(i+j==(3-1))

sum2=sum2+a[i][j];

}
}

[Link](sum);

[Link](sum2);

public class upperhalf

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(i==j||j>i)

[Link](a[i][j]+"\t");

else

[Link]("\t");

[Link]();

}
}

public class lowerhalf

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(i==j||j<i)

[Link](a[i][j]+"\t");

else

[Link]("\t");

[Link]();

}
public class rowsandcolsum

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

sum=0;

for(int j=0;j<3;j++)

sum=sum+a[i][j];

[Link]("row"+(i+1)+"sum="+sum);

for(int i=0;i<3;i++)

sum=0;

for(int j=0;j<3;j++)

sum=sum+a[j][i];
}

[Link]("column"+(i+1)+"sum="+sum);

import [Link].*;

public class matadd

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

sum=sum+a[i][j];

[Link](sum);

import [Link].*;

public class matsub

public static void main()

{
Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

sum=sum-a[i][j];

[Link](sum);

public class symmetrix

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int b[][]=new int[3][3];

int sum=0;

int l=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

}
for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

b[i][j]=a[j][i];

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

[Link](b[i][j]+"\t");

[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(a[i][j]==b[i][j])

l=l+1;

if(l==9)

[Link]("Symmetrix");

else

[Link]("Not Symmetrix");

}
public class oddsum

public static void main()

Scanner inp=new Scanner ([Link]);

int a[][]=new int[3][3];

int sum=0,sum2=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(a[i][j]%2==1)

sum=sum+a[i][j];

[Link](sum);

public class identity

public static void main()

Scanner inp=new Scanner ([Link]);


int a[][]=new int[3][3];

int l=0;

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

a[i][j]=[Link]();

for(int i=0;i<3;i++)

for(int j=0;j<3;j++)

if(i==j)

if(a[i][j]==1)

l=l+1;

else

if(a[i][j]==0 && i!=j)

l=l+1;

if(l==9)

[Link]("IDENTITY MATRIX");

else

[Link]("NOT IDENTITY MATRIX");

}
}

public class multiplication

public static void main()

Scanner inp=new Scanner ([Link]);

int x=[Link]();

int a[][]=new int[x][x];

int b[][]=new int[x][x];

int c[][]=new int[x][x];

int sum=0,sum2=0;

for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

a[i][j]=[Link]();

for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

b[i][j]=[Link]();

for(int i=0;i<x;i++)

sum=0;

for(int j=0;j<x;j++)

{
for(int k=0;k<x;k++)

c[i][j]=c[i][j]+(a[i][k]*b[k][j]);

for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

[Link](c[i][j]+"\t");

[Link]();

public class boundary

public static void main()

Scanner inp=new Scanner ([Link]);

int x=[Link]();

int a[][]=new int[x][x];

int sum=0,sum2=0;

for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

a[i][j]=[Link]();

}
for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

if(i==0)

[Link](a[i][j]+"\t");

else if(i==(x-1))

[Link](a[i][j]+"\t");

else if(j==0 && i!=0 && i!=(x-1))

[Link](a[i][j]+"\t");

else if(j==(x-1)&& i!=0 &&i!=(x-1))

[Link](a[i][j]+"\t");

else

[Link](" "+"\t");

[Link]();

public class alpha

public static void main()

Scanner inp=new Scanner ([Link]);

int x=[Link]();

String a[]=new String[x];

int sum=0,sum2=0;

String t="";

for(int i=0;i<x;i++)
{

a[i]=[Link]();

for(int i=0;i<x;i++)

for(int j=0;j<x-1;j++)

int b=a[i].compareTo(a[j]);

if(b<0)

{t=a[j];

a[j]=a[j+1];

a[j+1]=t;

[Link]();

for(int i=0;i<x;i++)

[Link](a[i]);

}
public class marks

public static void main()

Scanner inp=new Scanner ([Link]);

int a[]=new int[10];

int b[]=new int[10];

int d[]=new int[10];

int e[]=new int[10];

int f[]=new int[10];

String c[]=new String[10];

for(int i=0;i<10;i++)

[Link]("Enter name:");

c[i]=[Link]();

[Link]("Enter fisics marks:");

a[i]=[Link]();

[Link]("Enter chemistry marks");

b[i]=[Link]();

[Link]("Enter math marks");

d[i]=[Link]();

e[i]=a[i]+b[i]+d[i];

f[i]=e[i]/3;

[Link]("Name\t\t\tphysics\tchem\tmath\ttotal\tavg");

for(int i=0;i<10;i++)

[Link](c[i]+"\t\t\t"+a[i]+"\t"+b[i]+"\t"+d[i]+"\t"+e[i]+"\t"+f[i]);

}
}

public class inside

public static void main()

Scanner inp=new Scanner ([Link]);

int x=[Link]();

int a[][]=new int[x][x];

int sum=0,sum2=0;

for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

a[i][j]=[Link]();

for(int i=0;i<x;i++)

for(int j=0;j<x;j++)

if(i==0)

[Link]("\t");

else if(i==(x-1))

[Link]("\t");

else if(j==0 && i!=0 && i!=(x-1))

[Link]("\t");

else if(j==(x-1)&& i!=0 &&i!=(x-1))

[Link]("\t");

else
[Link](a[i][j]+"\t");

[Link]();

You might also like