1) To Overload A Function Area To Find Area Of Square , Rectangle , Circle And Triangle With The Corresponding Inputs import

[Link].*; public class OverloadArea { static void calcArea(Double r) { [Link]("Area Of The Circle Of Radius "+r+" Is :"); [Link](3.14*r*r+" sq. units"); } static void calcArea(int l,int b) { [Link]("Area Of The Rectangle Of Length "+l+" And Breadth "+b+" Is :"); [Link](l*b+" sq. units"); } static void calcArea(int side) { [Link]("Area Of The Square Of Side "+side+" Is :"); [Link](side*side+" sq. units"); } static void calcArea(float ba,float h) { [Link]("Area Of The Triangle Of Base "+ba+" And Height "+h+" Is :"); [Link](0.5*ba*h+" sq. units"); } static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter Choice Of Shape For Finding Area :"); [Link]("1) Circle"); [Link]("2) Rectangle"); [Link]("3) Square"); [Link]("4) Triangle"); int ch=[Link]([Link]()); switch(ch) { case 1: [Link]("Area Of Circle !"); [Link]("Enter Radius :"); Double r=[Link]([Link]()); calcArea(r); break; case 2: [Link]("Area Of Rectangle !"); [Link]("Enter Length :"); int l=[Link]([Link]());

[Link]("Enter Breadth :"); int b=[Link]([Link]()); calcArea( l, b); break; case 3: [Link]("Area Of Square !"); [Link]("Enter Side :"); int side=[Link]([Link]()); calcArea(side); break; case 4: [Link]("Area Of Triangle !"); [Link]("Enter Base :"); float ba=[Link]([Link]()); [Link]("Enter Height :"); float h=[Link]([Link]()); calcArea( ba, h); break; default: [Link]("Wrong Choice !");

2) To Search Name In An Array Inputted By The User By Linear Search Method import [Link].*; class Linear { String Names[]; int n; Linear(int nn)throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); n=nn; Names=new String[n]; [Link]("Enter Names"); for(int i=0;i<n;i++) { Names[i]=[Link](); } } //Just Practicing Descending Order void Arrange() { String t=""; for(int i=0;i<n-1;i++) { for(int j=i+1;j<n;j++) { if(Names[i].compareToIgnoreCase(Names[j])<0)

{ t=Names[j]; Names[j]=Names[i]; Names[i]=t; } } } } int Search(String v) { int k=0; for(int i=0;i<n;i++) { if([Link](Names[i])) { k=1; } } if(k==1) return 0; else return 1; } static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter No. Of Names"); int qn=[Link]([Link]()); Linear ob=new Linear(qn); [Link]("Enter Name To Searched"); String q=[Link](); if([Link](q)==0) {[Link]("Search Succesful");} else {[Link]("Search Unsuccesful");} } } 3) To Search Name In An Array Inputted By The User Using Binary Search Method import [Link].*; class Names { int size; String names[]; Names(int size) { [Link]=size;

names=new String[size]; } void input()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter Names :"); for(int i=0;i<size;i++) { [Link]("Enter Name At "+(i+1)); names[i]=[Link](); } } void display() { for(int i=0;i<size;i++) { [Link]("Name At "+(i+1)+" : "+names[i]); } } void seqsort() { String t=""; for(int i=0;i<size-1;i++) { for(int j=i+1;j<size;j++) { if(names[j].compareToIgnoreCase(names[i])<0) { t=names[j]; names[j]=names[i]; names[i]=t; } } } } int bsearch(String n) { int l,m,u,flag; l=m=flag=0; u=size-1; while(l<=u) { m=(l+u)/2; if(names[m].compareToIgnoreCase(n)>0) { u=m-1; }

if(names[m].compareToIgnoreCase(n)<0) { l=m+1; } if(names[m].compareToIgnoreCase(n)==0) { flag=m; break; } } if(flag!=0) return flag; else return -1; } static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter The Size"); int s=[Link]([Link]()); Names ob=new Names(s); [Link](); [Link]("\u000c"); [Link](); [Link](); [Link](); [Link]("Sorted Array :"); [Link](); [Link]("Enter Query "); String a=[Link](); int x=[Link](a); if(x!=-1) [Link](a+" Found At "+(x+1)); else [Link](a+" Not Found"); } } 4) To Ask User To Input A 2D Array , Check If It Is A Magic Square Or Not import [Link].*; public class Magicsquare { public static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter Size"); int s=[Link]([Link]());

int m[][]=new int[s][s]; int i,j; int sums[]=new int[s*2]; int r=0; int c=0; int x=0; [Link]("Enter Numbers"); for(i=0;i<s;i++) { for(j=0;j<s;j++) m[i][j]=[Link]([Link]()); } [Link]("Sum Of Rows"); for(i=0;i<s;i++) { for(j=0;j<s;j++) r=m[i][j]+r; sums[x]=r; [Link]("Sum Of Row"+i+" ="+r); x++; r=0; } for(i=0;i<s;i++) { for(j=0;j<s;j++) c=m[j][i]+c; sums[x]=c; [Link]("Sum Of Columns"+i+" ="+c); x++; c=0; } int k=0; for(i=0;i<s*2;i++) { if(sums[0]==sums[i]) k++; } if(k==s*2) {[Link]("Magic Square");} else {[Link]("Not A Magic Square ");} } } 5) To Ask User To Input To Input A String . Display The Length , Character At An Index , Which Is Inputted By The User , Display String In Double Quotes And Check A Character If It Is In Upper Case Or Not . import [Link].*; public class Stringprogram {

String sentence; void getString()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter Sentence"); sentence=[Link](); } int lengthString() { int l; l=[Link](); return l; } char charAtpos(int k) { char c=[Link](k); return c; } void printDoubleQuotes() { [Link]("\""+sentence+"\""); } boolean ifUpperCase(char cc) { if([Link](cc)==true) return true; else return false; } static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); Stringprogram ob=new Stringprogram(); [Link](); [Link]("Length : "+[Link]()); [Link]("Enter Index"); int a=[Link]([Link]()); [Link]("Character At "+a+" Is : "+[Link](a)); [Link](); [Link]("Enter Character For Checking"); char ccc=([Link]().charAt(0)); if([Link](ccc)==true) [Link](ccc+" Is Upper Case "); else [Link](ccc+" Is Not Upper Case "); }

6) All Sorts Compiled Together In A OOP Manner import [Link].*; class Sorts { int arr[]; int n; Sorts(int n) { this.n=n; arr=new int[n]; } void input()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); for(int i=0;i<n;i++) { [Link]("Enter Value At "+i+" => "); arr[i]=[Link]([Link]()); } } void sequential() { int i,j; int t=0; for(i=0;i<n-1;i++) { for(j=i+1;j<n;j++) { if(arr[i]>arr[j]) { t=arr[i]; arr[i]=arr[j]; arr[j]=t; } } } display(); } void selection() { int i,j; int t=0; int min,pos; for(i=0;i<n-1;i++) { min=arr[i]; pos=i;

for(j=i+1;j<n;j++) { if(arr[j]<min) { min=arr[j]; pos=j; } } t=arr[i]; arr[i]=arr[pos]; arr[pos]=t; } display(); } void bubble() { int i,j; int t=0; for(i=0;i<n-1;i++) { for(j=0;j<n-1-i;j++) { if(arr[j]>arr[j+1]) { t=arr[j]; arr[j]=arr[j+1]; arr[j+1]=t; } } } display(); } void insertion() { int i,j; int flag=0; for(i=1;i<n;i++) { flag=arr[i]; j=i-1; while(flag<arr[j]) { arr[j+1]=arr[j]; j--; if(j<0) break; } arr[j+1]=flag;

} display(); } void display() { int i; for(i=0;i<n;i++) [Link](arr[i]+" "); } static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter The Size Of Array "); int na=[Link]([Link]()); Sorts ob=new Sorts(na); [Link](); [Link]("What Sort Do You Want To Do ? "); [Link]("1) Sequential"); [Link]("2) Selection"); [Link]("3) Bubble"); [Link]("4) Insertion"); int c=[Link]([Link]()); if(c==1) [Link](); if(c==2) [Link](); if(c==3) [Link](); if(c==4) [Link](); } } 7) To Ask User To Input Two Numbers And Check If They Are An Amicable Pair Or Not import [Link].*; public class Amicable { static int sumOfFactors(int n) { int s=0; for(int i=1;i<n;i++) { if(n%i==0) { s=s+i; } } return s; }

static boolean checkPair(int x,int y) { [Link]("Sum Of Factors Of "+x+" = "+sumOfFactors(x)); [Link]("Sum Of Factors Of "+y+" = "+sumOfFactors(y)); if(x==sumOfFactors(y)&&y==sumOfFactors(x)) return true; else return false; } static void main()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter 1st No."); int x=[Link]([Link]()); [Link]("Enter 2nd No."); int y=[Link]([Link]()); //amicable ob1=new amicable(); if(checkPair(x,y)==true) [Link](x+" & "+y+" Form Amicable Pairs"); else [Link](x+" & "+y+" Don't Form Amicable Pairs"); } } 8) To Input A Number From The User And Display The Frequency Of Each Digit And Display The Sum Of All The Digits Of The Number import [Link].*; public class Number { long num; void input()throws IOException { InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter Number"); num=[Link]([Link]()); } void digitFrequency() { int i,j; int c=0; long n=num; long d; int k=0; while (n!=0) { k++; n=n/10; } long digits[]=new long[k]; n=num;

i=0; while(n!=0) { digits[i]=n%10; i++; n=n/10; } int count=0; for(i=0;i<10;i++) { for(j=0;j<k;j++) { if(i==digits[j]) count++; } if(count>0) [Link]("Frequency Of "+i +" = "+count); count=0; } } int sumDigits() { long n=num; int d; int sum=0; while (n!=0) { d=(int)n%10; sum=sum+d; n=n/10; } return sum; } static void main()throws IOException { Number ob=new Number(); [Link](); [Link](); [Link]("Sum Of Digits In "+[Link]+" : "+[Link]()); } } 9) Class Name : Library Data Members : int noc,price ; String title ; Member Methods : Library(String,int,int): Constructor To Assign Values , int calcStockWorth() : To Return The Total Stock , Display() : To Display import [Link].*; public class Library { String title; int noc,price;

Library(String title,int noc,int price) { [Link]=title; [Link]=noc; [Link]=price; } int calcStockWorth() { return noc*price; } void display() { [Link]("Title :"+title); [Link]("No. OF Copies :"+noc); [Link]("Price : "+price); [Link]("Total Stock Worth : "+calcStockWorth()); } public static void main()throws IOException { Library ob[]=new Library[2]; InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); int nocb,priceb; String titleo; for(int i=0;i<2;i++) { [Link]("Enter Title : "); titleo=[Link](); [Link]("Enter No. Of Copies : "); nocb=[Link]([Link]()); [Link]("Enter Price : "); priceb=[Link]([Link]()); ob[i]=new Library(titleo,nocb,priceb); } for(int i=0;i<2;i++) { ob[i].display(); } } } 10) Class Name : Employee Data Members : int empNo,basic ; String empName; double da,hra,it; Member Methods : Employee () : Constructor To Assign Values ; Double calcgross() : Return The Gross Amount ; Double calcnet() : Return Final Amount ; void Display() : Display Function class Employee { int empNo,basic; String empName; double da,hra,it; Employee(int empNo,String empName,int basic) {

[Link]=empNo; [Link]=empName; [Link]=basic; da=hra=it=0; } double calcgross() { da=0.35*basic; hra=0.2*basic; return (basic+da+hra); } double calcnet(double gross) { it=0.3*basic; return (gross-it); } void display() { calcnet(calcgross()); [Link]("Employee No. : "+empNo); [Link]("Employee Name : "+empName); [Link]("Employee Basic Salary : "+basic); [Link]("DA : "+da); [Link]("HRA : "+hra); [Link]("Net Gross : "+calcgross()); [Link]("Income Tax : "+it); [Link]("Net : "+calcnet(calcgross())); [Link](); } static void main() { Employee ob1=new Employee(1,"ABC",50000); [Link](); Employee ob2=new Employee(2,"XYZ",10000); [Link](); } } 11) To Make A Super Class D2point To Input 2 Set Of Points , Find The Distance Between Them And Also The Midpoint Then Make A Class D3point To Inherit All The Properties In D2point And Introduce A 3rd Set Of Point To Make It A 3D Space . Then Find The Distance Between The New Points SUPER CLASS import [Link].*; class d2point { double x,y; d2point() { x=0; y=0;

} d2point(double nx,double ny) { x=nx; y=ny; } double distanced2(d2point b) { double an; an=[Link]((b.x-x)*(b.x-x)+(b.y-y)*(b.y-y)); return an; } static d2point midpoint(d2point A,d2point B) { d2point newP=new d2point(); newP.x=(A.x+B.x)/2; newP.y=(B.y+B.y)/2; return newP; } void display() { [Link]("X Co-ordiante : "+x); [Link]("Y Co-ordiante : "+y); } } SUBCLASS import [Link].*; class d3point extends d2point { double z; d3point(double x,double y,double z) { super(x,y); this.z=z; } void display() { [Link](); [Link]("Z Co-ordiante : "+z); } static double distanced3(d3point ob1,d3point ob2) { // d3point D; double D=[Link]([Link]((ob1.x-ob2.x),2)+[Link]((ob1.y-ob2.y),2)+[Link]((ob1.zob2.z),2)); return D; } static void main()throws IOException {

InputStreamReader read=new InputStreamReader([Link]); BufferedReader in=new BufferedReader(read); double ax,ay,az; [Link]("Enter 1st X , Y Co-ordinate And Z Co-ordinate"); ax=[Link]([Link]()); ay=[Link]([Link]()); az=[Link]([Link]()); d2point T=new d2point(ax,ay);//OBJECT FOR 2D POINTS d3point X=new d3point(ax,ay,az);//OBJECT FOR 3D POINTS [Link]("Enter 2nd X , Y Co-ordinate And Z Co-ordinate"); ax=[Link]([Link]()); ay=[Link]([Link]()); az=[Link]([Link]()); d2point TT=new d2point(ax,ay);//OBJECT FOR 2D POINTS d3point Y=new d3point(ax,ay,az);//OBJECT FOR 3D POINTS [Link](); [Link](); [Link]("Distance 2d: "+d3point.distanced3(X,Y)); [Link]("Distance 3d: "+d3point.distanced3(X,Y)); [Link]("Midpoint : "); [Link](X,Y).display(); } } 12) To Input A Number From The User And Display The Sum Of Consecutive Numbers Equal To The Number Inputted import [Link].*; class Sum { public static void main()throws IOException { int i,j,k; InputStreamReader read=new InputStreamReader ([Link]); BufferedReader in=new BufferedReader(read); [Link]("Enter The Number"); int no=[Link]([Link]()); int s=0; int flag=0; for(i=1;i<no-1;i++) { s=i; for(j=(i+1);j<no;j++) {

s=s+j; if(s==no) { flag=1; for(k=i;k<=j;k++) { if(k==j) [Link](k+" = "+no); else [Link](k+" + "); } } if(flag==1) break; } } }