Scribd
Upload
47 views11 pages

Program

Oop program

Uploaded by

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

Program

Oop program

Uploaded by

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

Half Diamond

import [Link];
class Halfdiamond
{public static void main(String str[])
{ Scanner s=new Scanner([Link]);
[Link]("Enter number of diamond line");
int n=[Link]();
int sp=n-1, st=1; // sp=space & st=staric..
// int sp=2, st=1;
{ for(int i=0; i<n;i++)
// for(int i=0; i<3;i++)

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


{ [Link](" ");}
for(int k=0; k<st;k++)
{[Link]("*");}
[Link]();

sp--;
st=st+2;
} }
}

Full Diamond
import [Link];
public class FullDiamond
{public static void main(String str[])
{ Scanner s=new Scanner([Link]);
int c=1;
[Link]("Enter odd number for diamond lines");
int n=[Link]();
for(int i=1; i<=n; i++)
{
for(int j=c; j<=n/2;j++)
{[Link](" ");}
for(int k=1; k<=c*2-1;k++)
{[Link]("*");}
if(i<=n/2)
c++;
else
c=c-1;
[Link]();
}
}

Prime Number
import [Link].*;
public class Prime

{ public static void main(String args[])


{ Scanner s=new Scanner([Link]);
int c=0;
[Link]("Enter number");
int n=[Link]();

for(int i=2;i<=n/2;i++)
{
if(n%i==0)
{
[Link](n+" is not prime number");
c=1;
break;
}
}
if(c==0) { [Link](n+" is prime number"); }
}
}

Prime In Array
import [Link].*;
public class PrimeInArray
{ public static void main(String args[])
{ Scanner s=new Scanner([Link]);
int n[]={1,2,3,4,5,6,7,8,9};
[Link]("Prime numbers");
for(int j=0;j<[Link];j++)
{ int c=0;
for(int i=2;i<=n[j]/2;i++)
{
if(n[j]%i==0)
{
c=1;
break;
}
}
if(c==0) { [Link](n[j]+","); }
}
[Link]();

[Link]("not Prime numbers");


for(int j=0;j<[Link];j++)
{ int c=0;
for(int i=2;i<=n[j]/2;i++)
{
if(n[j]%i==0)
{
c=1;
break;
}
}
if(c==1) { [Link](n[j]+","); }
}
}
}

Prime Number 100


// Count how many prime numbers in first 100 number?
public class PrimeNumber100
{ public static void main(String args[])
{
int n[]=new int[101];
for(int i=2; i<=100;i++)
{n[i]=i;}
int count=0;
[Link]("Prime numbers");
for(int j=2;j<[Link];j++)
{ int c=0;
for(int i=2;i<=n[j]/2;i++)
{
if(n[j]%i==0)
{
c=1;
break;
}
}
if(c==0) {
[Link](n[j]+",");
count++;
}

}
[Link]();
[Link]("count="+count);

}
}

Reverse Number in Array


public class Reversenumber
{public static void main(String str[])
{
for(int i=1;i<=10; i++)
{[Link](i+" " +(11-i));}
}

Reverse Array
public class ReverseArray
{public static void main(String str[])
{
int Arr1[]={1,2,3,4,5,6,7,8,9,10};
[Link]("Elements of Array");
[Link]("1,2,3,4,5,6,7,8,9,10");
[Link]("Reverse element of Array");
for(int i=[Link]-1; i>=0; i--)
{[Link](Arr1[i]+",");}
}

Reverse Array
public class ArrayCopy
{public static void main(String str[])
{
int n1[]={1,2,3,4,5,6,7,8,9};
[Link]("elemnts of first array");
[Link]("1,2,3,4,5,6,7,8,9");
int n2[]=new int[9];
[Link]("copy of 2nd Array elements");
for(int i=0;i<[Link]; i++)
{
n2[i]=n1[i];
[Link](n2[i]+",");
}

Choice In Method
import [Link].*;
public class ChoiceInMethod
{ public static void sum(int a,int b)
{
[Link](a+b);
}
public static void sub(int a,int b)
{
[Link](a-b);
} public static void mul(int a,int b)
{
[Link](a*b);
}

public static void main(String talhaShabbir[])


{Scanner s=new Scanner([Link]);
[Link]("enter value of a");
int a=[Link]();
[Link]("enter value of a");
int b=[Link]();
[Link]("choose value 1 for sum 2 for sub 3 for mul" );
for(int i=1; i<=2;i++) // for two value check..
{
int ch=[Link]();
switch(ch)
{ case 1:
sum(a,b);
break;
case 2:
sub(a,b);
break;
case 3:
mul(a,b);
break;
default:
[Link]("invalid");
break;
} }
}

Choice Method
import [Link];
class ChoiceMethods
{
static void sum(int a,int b)
{[Link]("sum="+(a+b));}
static void sub(int a,int b)
{[Link]("sub="+(a-b));}

static void mul(int a,int b)


{[Link]("mul="+(a*b));}
static void div(int a,int b)
{[Link]("div="+(a/b));}

public static void main(String str[])


{
Scanner s=new Scanner([Link]);
int a,b;
[Link]("enter first number");
a=[Link]();
[Link]("enter second number");
b=[Link]();
[Link]("what do you want");
[Link]("enter 1 for sum function 2 for subtraction 3 for
division 4 for multiplication");
int choice=[Link]();
switch(choice)
{
case 1:
sum(a,b);
break;
case 2:
sub(a,b);
break;
case 3:
div(a,b);
break;
case 4:
mul(a,b);
break;
default:
[Link]("invalid");
}
}}

Diagnal Elements In Array


public class DiagnalElementsInArray
{public static void main(String TalhaShabbir[])

{[Link]("Diagnal elements");
int n[][]={{1,2,3},
{4,5,6},
{7,8,9}};
for(int i=0;i<[Link];i++)
{
for(int j=0;j<[Link];j++)
{ if(i==j)
[Link](n[i][j]+",");
}
}

[Link]("");
[Link](" 2nd Diagnal elements");
int row=0,col=2;
for(int k=0;k<3;k++)
{ [Link](n[row][col]+",");
row++;
col--;
}

}
}

Find location

import [Link];
public class FindLocation
{public static void main(String talha[])
{ Scanner s=new Scanner([Link]);
int loc=-1, n[]={1,2,3,4,5,6,7,8,9,10};
[Link]("Enter number from first 10 integer");
int num=[Link]();
for(int i=0; i<[Link]; i++)
{ if(num==n[i])
loc=i;
}

if(loc>=0)
[Link]("Number found at location= "+(loc+1));
else
[Link]("Number not found");
}
}

Max Min
import [Link];
class MaxMin
{
public static void main(String str[])
{
Scanner s=new Scanner([Link]);
[Link]("Enter 5 number");
int n[]=new int[5];
for(int i=0; i<5; i++)
{n[i]=[Link]();}

int min=n[0];
for(int i=1; i<[Link]; i++)
{if(min>n[i])
min=n[i];}

int max=n[0];
for(int i=1; i<[Link]; i++)
{if(max<n[i])
max=n[i];}
[Link]("max"+max);
[Link]("min"+min);
}
}

Repeat count Number in Array


public class RepeatCount
{ public static void main(String str[])
{
int n[]={2,3,4,2,3,4,5,4,3,2,1};
for(int i=0; i<[Link]; i++)
{
int c=0;
for(int j=i-1;j>=0; j--)

if(n[i]==n[j])
{
c=1;
break;
}
if(c==0)
{
int count=0;
for(int k=0; k<[Link]; k++)
if(n[i]==n[k])
count++;
[Link](n[i]+" found "+count+" Times ");

}
}

}
Second Max Min
public class SecondMaxMin

{
public static void main(String args[]){
int c;
int n[] = {99, 20, 25, 33, 96, 92,100,109};
for(int i = 0; i<[Link]; i++ )
{
for(int j = i+1; j<[Link]; j++)
{

if(n[i]>n[j])
{
c = n[i];
n[i] = n[j];
n[j] = c;
}
}
}
[Link]("second maximum number is = "+n[[Link]-2]);

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


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

if(n[i]<n[j])
{
c = n[i];
n[i] = n[j];
n[j] = c;
}
}
}
[Link]("second minumum number is = "+n[[Link]-2]);
}
}

Two DIemension
public class TwoDimension
{public static void main(String talha[])
{int n[][]={{1,2,3},
{4,5,6},
{7,8,9}};
for(int i=0;i<[Link];i++)
{
for(int j=0;j<[Link];j++)
{
[Link](n[i][j]+",");
}
}
}
}

You might also like