import [Link].
*;
class Odius
{
int arr[];
int n;
static Scanner sc = new Scanner([Link]);
public Odius()
{
}
public Odius(int nx)
{
size=s;
arr=new int[size];
}
public void getdata()
{
[Link]("Enter numbers in array");
for(int i=0;i<size;i++)
{
arr[i]=[Link]();
}
}
public void show_Odius()
{
int i,x,d,c;
for(i=0;i<size;i++)
{
x=arr[i];c=0;
while(x!=0)
{
d=x%2;
if(d==1)
c++;
x/=2;
}
if(c%2!=0)
[Link]("Number "+arr[i]+" is Odius");
}
}
public static void main(String args[])
{
Odius obj=new Odius();
[Link]("Enter the size");
int a=[Link]();
Odius obj=new Odius(a);
[Link]();
obj.show_Odius();
}
}
import [Link].*;
class Prime_Factors
{
int arr[];
int s;
static Scanner sc = new Scanner([Link]);
public Prime_Factors(int lim)
{
s=lim;
arr=new int[size];
}
public void Fillarray()
{
[Link]("Enter numbers in array");
for(int i=0;i<s;i++)
{
arr[i]=[Link]();
}
}
public void show_Primefacts()
{
int i,x,j;
for(i=0;i<s;i++)
{
x=arr[i];j=2;
[Link]("Prime factor of "+x+" : ");
while(x!=1)
{
if(x%j==0)
{
[Link](j+" ");
x=x/j;
}
else
j++;
}
[Link]();
}
public static void main(String args[])
{
[Link]("Enter the size");
int a=[Link]();
Prime_Factors obj=new Prime_Factors(a);
[Link]();
obj.show_Primefacts();
}
}
import [Link].*;
class Sorter
{
int arr[]=new int[100];
static Scanner sc = new Scanner([Link]);
public Sorter()
{
for(int i=0;i<100;i++)
arr[i]=0;
}
public void readlist()
{
[Link]("Enter numbers in array");
for(int i=0;i<100;i++)
{
arr[i]=[Link]();
}
}
public int Indexofmin(int Startindex)
{
int min=arr[Startindex],p=Startindex;
for(int j=Startindex+1;j<100;j++)
{
if(arr[j]<min)
{
min=arr[j];
p=j;
}
}
return p;
}
public void selectionsort()
{
int i,pos,y;
for(i=0;i<99;i++)
{
pos=Indexofmin(i);
y=arr[pos];
arr[pos]=arr[i];
arr[i]=y;
}
}
public void displaylist()
{
for (int i=0;i<100;i++)
{
[Link](arr[i]);
}
}
public static void main(String args[])
{
Sorter obj=new Sorter();
[Link]();
[Link]("Original numbers are");
[Link]();
[Link]();
[Link]("Numbers is ascending order are");
[Link]();
}
}
DOUBLE DIMENSIONAL ARRAY
Q. Write a program to input data in double dimensional array and find
the largest and smallest number in array.
import [Link].*;
class D_display
{
int arr[][];
int r,c;
int max, min;
static Scanner sc=new Scanner([Link]);
public D_display(int rr,int cc)
{
r=rr;
c=cc;
max=0;
min=0;
arr=new int[r][c];
}
public void getdata()
{
int i,j;
[Link]("Enter numbers in array");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
arr[i][j]=[Link]();
}
}
}
public void arr_display()
{
int i,j;
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
[Link](arr[i][j]+"\t");
}
[Link]();
}
}
public void find()
{
max=arr[0][0];
min=arr[0][0];
int i,j;
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
if(arr[i][j]>max)
max=arr[i][j];
if(arr[i][j]<min)
min=arr[i][j];
}
}
}
public void display()
{
[Link]("largest number is : "+max);
[Link]("smallest number is : "+min);
}
public static void main(String args[])
{
[Link]("Eneter row and column of array");
int a=[Link]();
int b=[Link]();
D_display obj=new D_display(a,b);
[Link]();
[Link]("The Matrix is");
obj.arr_display();
[Link]();
[Link]();
}
}
Q. Write a program to find the sum of all diagonal elements stored in
double dimensional array.
import [Link].*;
class D_diagonal
{
int arr[][];
int n;
int sum;
static Scanner sc=new Scanner([Link]);
public D_diagonal(int rr)
{
n=rr;
sum=0;
arr=new int[n][n];
}
public void getdata()
{
int i,j;
[Link]("Enter numbers in array");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
arr[i][j]=[Link]();
}
}
}
public void arr_display()
{
int i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
[Link](arr[i][j]+"\t");
}
[Link]();
}
}
public void find()
{
int i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==j||i+j==n-1)
sum=sum+arr[i][j];
}
}
}
public void display()
{
[Link]("sum of diagonal elements is : "+sum);
}
public static void main(String args[])
{
[Link]("Eneter size of array");
int a=[Link]();
D_diagonal obj=new D_diagonal(a);
[Link]();
[Link]("The Matrix is");
obj.arr_display();
[Link]();
[Link]();
}
}