Half Diamond

import java.util.Scanner;
class Halfdiamond
{public static void main(String str[])
{ Scanner s=new Scanner(System.in);
System.out.println("Enter number of diamond line");
int n=s.nextInt();
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++)

{ System.out.print(" ");}
for(int k=0; k<st;k++)
{System.out.print("*");}
System.out.println();

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

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

Prime Number
import java.util.*;
public class Prime

{ public static void main(String args[])

{ Scanner s=new Scanner(System.in);
int c=0;
System.out.println("Enter number");
int n=s.nextInt();

for(int i=2;i<=n/2;i++)
{
if(n%i==0)
{
System.out.println(n+" is not prime number");
c=1;
break;
}
}
if(c==0) { System.out.println(n+" is prime number"); }
}
}

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

System.out.println("not Prime numbers");

for(int j=0;j<n.length;j++)
{ int c=0;
for(int i=2;i<=n[j]/2;i++)
{
if(n[j]%i==0)
{
c=1;
break;
}
}
if(c==1) { System.out.print(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;
System.out.println("Prime numbers");
for(int j=2;j<n.length;j++)
{ int c=0;
for(int i=2;i<=n[j]/2;i++)
{
if(n[j]%i==0)
{
c=1;
break;
}
 }
if(c==0) {
System.out.print(n[j]+",");
count++;
}

}
System.out.println();
System.out.println("count="+count);

}
}

Reverse Number in Array

public class Reversenumber
{public static void main(String str[])
{
for(int i=1;i<=10; i++)
{System.out.println(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};
System.out.println("Elements of Array");
System.out.println("1,2,3,4,5,6,7,8,9,10");
System.out.println("Reverse element of Array");
for(int i=Arr1.length-1; i>=0; i--)
{System.out.print(Arr1[i]+",");}
}

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

Choice In Method
import java.util.*;
public class ChoiceInMethod
{ public static void sum(int a,int b)
{
System.out.println(a+b);
}
public static void sub(int a,int b)
{
System.out.println(a-b);
} public static void mul(int a,int b)
{
System.out.println(a*b);
}

public static void main(String talhaShabbir[])

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

Choice Method
import java.util.Scanner;
class ChoiceMethods
{
static void sum(int a,int b)
{System.out.println("sum="+(a+b));}
static void sub(int a,int b)
{System.out.println("sub="+(a-b));}

static void mul(int a,int b)

{System.out.println("mul="+(a*b));}
static void div(int a,int b)
{System.out.println("div="+(a/b));}

public static void main(String str[])

{
Scanner s=new Scanner(System.in);
int a,b;
System.out.println("enter first number");
a=s.nextInt();
System.out.println("enter second number");
b=s.nextInt();
System.out.println("what do you want");
System.out.println("enter 1 for sum function 2 for subtraction 3 for
division 4 for multiplication");
int choice=s.nextInt();
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:
System.out.println("invalid");
}
}}

Diagnal Elements In Array

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

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

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

}
}

Find location

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

if(loc>=0)
System.out.println("Number found at location= "+(loc+1));
else
System.out.println("Number not found");
}
}

Max Min
import java.util.Scanner;
class MaxMin
{
public static void main(String str[])
{
Scanner s=new Scanner(System.in);
System.out.println("Enter 5 number");
int n[]=new int[5];
for(int i=0; i<5; i++)
{n[i]=s.nextInt();}

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

int max=n[0];
for(int i=1; i<n.length; i++)
{if(max<n[i])
max=n[i];}
System.out.println("max"+max);
System.out.println("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<n.length; 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<n.length; k++)
if(n[i]==n[k])
count++;
System.out.println(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<n.length; i++ )
{
for(int j = i+1; j<n.length; j++)
{

if(n[i]>n[j])
{
c = n[i];
n[i] = n[j];
n[j] = c;
}
}
}
System.out.println("second maximum number is = "+n[n.length-2]);

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

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

if(n[i]<n[j])
{
c = n[i];
n[i] = n[j];
n[j] = c;
}
}
}
System.out.println("second minumum number is = "+n[n.length-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<n.length;i++)
{
for(int j=0;j<n.length;j++)
{
System.out.print(n[i][j]+",");
}
}
}
}