Scribd
Upload
13 views

Computer Programs

The document contains the code for multiple Java programs. It defines classes with methods to accept input arrays, sort and rearrange arrays, find sums and saddle points. The programs take 2D arrays as input and perform various operations on them.

Uploaded by

Priya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Computer Programs

The document contains the code for multiple Java programs. It defines classes with methods to accept input arrays, sort and rearrange arrays, find sums and saddle points. The programs take 2D arrays as input and perform various operations on them.

Uploaded by

Priya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

import java.util.

*;

class asign_8

{ Scanner ob=new Scanner(System.in);

int n;

int arr[][];

void accept()

{ System.out.println("Input:");

System.out.print("n=");

n=ob.nextInt();

arr=new int[n][n];

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

{ for( int j=0;j<n;j++)

{arr[i][j]=ob.nextInt();

void display()

System.out.println("Output");

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

{System.out.println();

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

{System.out.print(arr[i][j]+" ");

System.out.println();

void saddle()

int max=0;

int min=0;

int x,f=0;

for(int i=0;i<n;i++)
{ min=arr[i][0];

x=0;

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

if (arr[i][j]<min)

min=arr[i][j];

x=j;

max=arr[0][x];

for(int k=0;k<n;k++)

if (arr[k][x]>max)

{max=arr[k][x];

if(max==min)

{System.out.println("Saddle point="+max);

f=1;

if(f==0)

{System.out.println(" no saddle point");

void main()

{accept();

display();

saddle();

}
import java.util.*;

class assign_7

{ Scanner ob=new Scanner(System.in);

int n;

int arr[][];

int i,j;

void accept()

{ System.out.print("INPUT:N=");

n=ob.nextInt();

if(n>3||n<10)

System.out.println("FIRST CHARACTER:");

char ch1=ob.next().charAt(0);

System.out.println("SECOND CHARACTER:");

char ch2=ob.next().charAt(0);

System.out.println("THIRD CHARACTER:");

char ch3=ob.next().charAt(0);

char arr[][]=new char[n][n];

for( i=0;i<n;i++)

for( j=0;j<n;j++)

if((i==0 &&j==0)||(i==n-1 && j==n-1)||(i==0 &&j==n-1)||(i==n-1 && j==0))

{ arr[i][j]=ch1;

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

{arr[i][j]=ch3;

else

{arr[i][j]=ch2;

}} }

for( i=0;i<n;i++)

{ System.out.println();

for( j=0;j<n;j++)
System.out.println(arr[i][j]+"");}}}}

import java.util.*;

class assign6

{ Scanner ob=new Scanner(System.in);

int m;

int j;

int i;

int arr[][];

int s[];

void accept()

{ System.out.println("M=");

m=ob.nextInt();

arr=new int[m][m];

if(m>3||m<10)

for( i=0;i<m;i++)

{ for( j=0;j<m;j++)

{arr[i][j]=ob.nextInt();

else

System.out.println("The matrix is out of range");

void original ()

System.out.println("Original matrix");

for(i=0;i<m;i++)

{System.out.println();

for( j=0;j<m;j++)

{System.out.print(arr[i][j]+" ");

System.out.println();

}
}

void rearrange()

{System.out.println("REARRANGED MATRIX");

int k=0;

arr=new int [(m-2)*(m-2)][(m-2)*(m-2)];

for( i=0;i<m;i++)

{ for( j=0;j<m;j++)

if(i!=0 && j!=0 && i!=m-1 && j!=m-1)

s[k++]=arr[i][j];

void sort()

for( i=0;i<arr.length;i++)

for(j=i+1;j<arr.length-1;j++)

if(s[i]>s[j])

{int temp=s[i];

s[i]=s[j];

s[j]=temp;

void sum()

{int s=0;

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

{ for(int j=0;j<m;j++)

if(i==j)

{ s=s+arr[i][j];

System.out.print("SUM OF THE DIAGONAL ELEMENTS="+s);

}
}

void main()

{accept();

original();

rearrange();

sort();

sum();

import java.util.*;

class assign_9

{Scanner ob=new Scanner(System.in);

int a[];

int b[][];

int n;

void accept()

{ System.out.println("Input:");

System.out.println("N=");

n=ob.nextInt();

a=new int[n];

b=new int[n][n];

if(n>2 && n<10)

{ System.out.println("ENTER THE ELEMENTS OF THE SINGLE DIMENSIONAL ARRAY");

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

a[i]=ob.nextInt();

else

{ System.out.println("matrix is out of range");

void display1()
{System.out.print("Sorted array:");

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

{System.out.print(a[i]+" ");

void display()

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

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

{System.out.print(b[i][j]+" ");

System.out.println();

void sort()

for(int i=0;i<a.length-1;i++)

for(int j=i+1;j<a.length;j++)

if(a[i]>a[j])

{int temp=a[i];

a[i]=a[j];

a[j]=temp;

void fill()

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

{int k=0;
for(int j=0;j<n;j++)

{if((i+j)>=n)

{b[i][j]=a[k++];

else

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

void main()

{accept();

sort();

display1();

System.out.println("Filled matrix");

fill();

display();

import java.util.*;

class assign_10

{ Scanner ob=new Scanner(System.in);

int N;

int n=N*N;

int arr[][];

void accept()

{ System.out.println("Input:");

System.out.print("n");

n=ob.nextInt();

arr=new int[n][n];

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

{ for( int j=0;j<n;j++)

{arr[i][j]=ob.nextInt();

void display()

System.out.println("Output");
for(int i=0;i<n;i++)

{System.out.println();

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

{System.out.print(arr[i][j]+" ");

System.out.println();

void main()

{accept();

display();

You might also like