Acknowledgement
Index
double bill=0.0d;
if(n<=100)
bill=n*3.0;
bill=(100*3)+(n-100)*4.5;
bill=(100*3)+(100*4.5)+(n-200)*5.0;
else
bill=(100*3.0)+(100*4.5)+(100*5.0)+(n-300)*6.5;
Program 2 –
class slab2
double r=0.0d;
if(c<=100)
r=c*1;
r=(100*1)+(c-100)*1.50;
r=(100*1)+(200*1.5)+(c-300)*2;
else
r=(100*1)+(200*1.5)+(200*2)+(c-500)*0.5;
double asc=5/100*r;
double t=r+asc;
}}
Variable name Data type Variable description
C integer To store number of units
T double To store total amount
class des
int choice=sc.nextInt();
switch(choice)
case 1:
break;
case 2:
int l=sc.nextInt();
int b=sc.nextInt();
int area=l*b;
break;
case 3:
double r=sc.nextDouble();
double area=Math.PI*r*r;
}
break;
default :
System.out.println("Invalid choice");
sc.close();
Program 2 –
import java.util.Scanner;
class des1
switch(ch)
case '+':
System.out.println("Enter a number");
int a=sc.nextInt();
int b=sc.nextInt();
int sum=a+b;
break;
case '-':
System.out.println("Enter a number");
int a=sc.nextInt();
int b=sc.nextInt();
int dif;
if(a>b)
dif=a-b;
else
dif=b-a;
break;
case '*':
System.out.println("Enter a number");
int a=sc.nextInt();
int b=sc.nextInt();
int p=a*b;
break;
case '/':
System.out.println("Enter a number");
int a=sc.nextInt();
int d;
if(a>b)
d=a/b;
else
d=b/a;
break;
case '%':
System.out.println("Enter a number");
int a=sc.nextInt();
int b=sc.nextInt();
int re;
if(a>b)
re=a%b;
else
re=b%a;
}
break;
default:
System.out.println("Invalid choice");
Pattern printing –
Program 1 –
class pattern1
int c=0,p;
for(int i=0;i<=9;i++)
for(int j=0;j<=i;j++)
p=c*j;
System.out.print(p+"\t");
System.out.println();
c++;
Program 2 –
class pattern2
int c=1,k;
for(int i=1;i>=4;i++)
{ k=1;
for(int j=4;j>=i;j--)
System.out.print(" ");
}
for(k=1;k<=c;k++)
System.out.print(k);
for(int a=(k-1);a>=1;a--)
System.out.print(a);
System.out.println();
c++;
Linear search –
Program 1
class linear1
{
String a[]={"tom","jake","jimmy","austin","hart","vince","angela"};
int l=a.length;
int s=0;
for(int i=0;i<l;i++)
if(a[i].equals(n)==true)
s=1;
break;
if(s==1)
else
Program 2 –
class linear2
int a[]={1,4,5,6,5,3,6,8,9,7,55,7,7,8,8,9,5};
int l=a.length;
int c=0;
for(int i=0;i<l;i++)
if(a[i]==n)
c=1;
break;
if(c==1)
System.out.println("Element found");
else
System.out.println("Element not found");
Binary search –
Program 1 –
class binary1
int a[]={5,10,15,20,25,30,35,40,45,50};
int l=0,u=9,m=0,flag=0;
while(l<=u)
m=(l+u)/2;
if(n>a[m])
l=m+1;
else if(n<a[m])
u=m+1;
else
flag=1;
break;
if(flag==1)
else
Program 2 –
class binary2
int a[]={5,7,9,11,15,20,30,45,89,97};
int l=0,u=9,m=0,flag=0;
while(l<=u)
m=(l+u)/2;
if(n>a[m])
l=m+1;
else if(n<a[m])
u=m+1;
else
flag=1;
break;
if(flag==1)
else
}
Variable name Data type Description
l integer To store length of array
u integer Upper limit
l integer Lower limit
m integer Mid term
Selection sorting –
Program 1 –
import java.util.Scanner;
class selectionSorting1
for(int i=0;i<50;i++)
System.out.println("Enter name");
name[i]=sc.nextLine();
marks[i]=sc.nextInt();
for(int j=0;j<=49;j++)
String min=name[j];
int pos=j;
for(int k=j+1;k<50;k++)
if(name[j].compareTo(min)<0)
min=name[k];
pos=k;
String t=name[j];
name[j]=name[pos];
name[pos]=t;
for(int i=0;i<50;i++)
System.out.println(name[i]+"\t"+marks[i]);
class selectionSorting2
int min,pos,temp;
for(int i=0;i<25;i++)
System.out.println("enter a value");
values[i]=sc.nextInt();
for(int i=0;i<=24;i++)
min=values[i];
pos=i;
for(int j=i+1;j<25;j++)
if(values[j]<min)
{
min=values[j];
pos=j;
temp=values[pos];
values[pos]=values[i];
values[i]=temp;
for(int i=0;i<25;i++)
System.out.println(values[i]);
Bubble sorting –
Program 1 –
class bubble1
{
int a[]={5,3,8,4,9,2,1,12,98,16};
for(int i=0;i<a.length;i++)
for(int j=0;j<a.length-1-i;j++)
if(a[j]>a[j+1])
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
for(int k=0;k<a.length;k++)
System.out.println(a[k]);
}
Variable name Data type Description
temp integer Temporary variable
Program 2 –
import java.util.Scanner;
class bubble2
for(int i=0;i<20;i++)
name[i]=sc.nextLine();
for(int i=0;i<=19;i++)
for(int j=0;j<20-i-1;j++)
if(name[j].compareTo(name[j+1])<0)
{
String t=name[j];
name[j]=name[j+1];
name[j+1]=t;
for(int i=0;i<25;i++)
System.out.println(name[i]);
Function overloading –
Program 1 –
import java.util.Scanner;
class overload
if(a>b)
System.out.println(a);
else
System.out.println(b);
if((int)ch1>(int)ch2)
System.out.println(ch1);
else
System.out.println(ch2);
if(s1.length()>s2.length())
System.out.println(s1);
else
System.out.println(s2);
Program 2 –
import java.util.Scanner;
class overload1
int choice=sc.nextInt();
switch(choice)
case 1:
int l=sc.nextInt();
cost(l);
break;
case 2:
int b=sc.nextInt();
cost(l,b);
break;
case 3:
int l=sc.nextInt();
int b=sc.nextInt();
int h=sc.nextInt();
cost(l,b,b);
break;
default :
System.out.println("Invalid choice");
int cost=a*10;
int area=a*b;
int cost=area*20;
int area=2*(a+b)*c;
int cost=area*5;
Functions –
Program 1 –
class date
int dd,mm,yy;
public date()
dd=0;
mm=0;
yy=0;
dd=d;
mm=m;
yy=y;
System.out.println(dd+"/"+mm+"/"+yy);
if(yy%4==0)
return true;
else
return false;
Program 2 –
class date2
int c=0;
for(int i=1;i<=n;i++)
if(n%i==0)
c++;
}
if(c==2)
return true;
else
return false;
for(int j=100;j<=999;j++)
if(fact(j)==true)
System.out.print(j);