Acknowledgement

It gives me a great pleasure to have an opportunity here to

acknowledge and express my humble gratitude to the one who
helped me in making the project. Although it is really
impossible to thank everyone individually. I remember all those
who have guided me in completition of the project. I sincerely
acknowledge a deep gratitude for the valuable guidance,
suggestion and generous help extended to me by subject
teacher in the project.
-Saumya Chauhan
 Certificate
This is to certify that Saumya Chauhan of class 11A, under the
guidance of Mr. Sachidanand Gairola has prepared a project on
the subject Computer within the syllabus of ICSE.
 Programs from Function
Q1=Design a class function –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Void compute () = to check the number is prime or not.
Ans=import java.util.*;
Class function

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

void compute ()
 {

int i, c=0;

for (i=1; i<=n; i++)

if (n%i==0)

c++;

if (c==2)

System .out .println ("Prime number");

else

System .out .println ("Not a Prime number");

}

public static void main (String args [])

function obj= new function ();

obj.accept ();

obj.compute ();

}
Output=Enter any number
13
Prime number
Enter any number
62
Not a Prime number
Q2=Design a class prime –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Void compute () = to check the number is palindrome or not
Ans=import java.util.*;
class prime

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

void compute ()

int b, r, s=0;
 b=n;

while (b>0)

r=b%10;

s=s*10+r;

b=b/10;

if (s==n)

System .out .println ("Palindrome number");

else

System .out .println ("Not a Palindrome number");

}

public static void main (String args [])

prime obj= new prime ();

obj.accept ();

obj.compute ();

}
Output= Enter any number
555
Palindrome number
Enter any number
656
Palindrome number
Q3=Design a class series –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int fact (int x) = to return the factorial of parameter
Void compute () =to display the sum of all factorial till n
Ans= import java.util.*;
class series

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int fact (int x)

{
 int i, f=1;

for (i=1; i<=x; i++)

f=f*i;

return f;

void compute ()

int i, s=0;

for (i=1; i<=n; i++)

s=s+fact (i);

System .out .println ("Sum is"+s);

public static void main (String args [])

series obj= new series ();

obj.accept ();
 obj.compute ();

Output= Enter any number

Sum is 873

Enter any number

30

Sum is 864159207
Q4=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int count factor (int x) = to return the total number of factor
Of x
Void compute () = to display all prime number from 1 to n.
Ans= import java.util.*;
class number

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println("Enter any number");

n=sc.nextInt ();

int countfactor (int x)

 {

int i, c=0;

for (i=1; i<=x; i++)

if(x%i==0)

c++;

return c;

void compute ()

int i;

for (i=1; i<=n; i++)

int k =countfactor (i);

if (k==2)

System .out .println (i);

public static void main (String args [])

 {

number obj= new number ();

obj.accept ();

obj.compute ();

Output= Enter any number=13

11

13
Q5=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int count zero (int x) = to return the frequency of zero digit
Void display () = to check the number is duck number or not
Ans= import java.util.*;
class number

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int countzero (int x)

{
 int r, c=0;

while (n>0)

{
r=n%10;

If(r==0)

c++;

x=x/10;

return c;

void display ()

int k =countzero (n);

If (k>=1)

System .out .println ("Duck number");

else

System .out .println("Not a Duck number");

}

public static void main (String args [])

{
 number obj= new number ();

obj.accept ();

obj.display ();
}

Output=Enter any number=4008

Duck number
Q6=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Boolean check prime (int x) = to check whether the
Parameter is prime or not
Int reverse () = to return the reverse of the parameter
Void display () = to check the number is emrip number or
not
Ans= import java.util.*;
class number

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

}
boolean check prime (int x)

int i, c=0;

for (i=1; i<=x; i++)

If(x%i==0)

c++;

If(c==2)

return true;

else

return false;

int reverse (int x)

int r, s=0;

while(x>0)

r=x%10;

s=s*10+r;

x=x/10;

}
 return s;

void display ()

boolean p= check prime (n);

int m =reverse (n);

boolean t =check prime (m);

If (p==true&& t== true)

System .out .println ("Emrip number");

else

System .out .println ("Not a Emrip number");

public static void main (String args [])

number obj= new number ();

obj.accept ();

obj.display ();

}
Output= Enter any number

13

Emrip number

Enter any number

27

Not a Emrip number

Q7=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Boolean check prime (int x) = to check whether the
Parameter is prime or not
Int reverse () = to return the reverse of the parameter
Void display () = to display emrip number from 10 to n
Ans= import java.util.*;
class number

Int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

boolean check prime (int x)

{

int i, c=0;

for (i=1; i<=n; i++)

if(x%i==0)

c++;

if(c==2)

return true;

else

return false;

int reverse (int x)

int r, s=0;

while(x>0)

r=x%10;

s=s*10+r;

x=x/10;

return s;
 }

void display ()

for (int i=10; i<n; i++)

boolean p= check prime (i);

int m =reverse (i);

boolean t =check prime (m);

if (p==true&& t== true)

System .out .println (i);

public static void main (String args [])

number obj= new number ();

obj.accept ();

obj.display ();

}
Output= Enter any number=39
11

13
17
31
37
Q8=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int binary (int x) = to return the binary form
Void display () = to return binary of all number from 1 to n
Ans= import java.util.*;
class number

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int binary (int x)

{
 String s="";

Int r;

While(x>0)

r=x%2;

s=r+s;

x=x/2;

int p= Integer.parseInt(s);

return p;

}
void display ()

for (int i=1; i<=n; i++)

int k =binary (i);

System .out .println (k);

public static void main (String args [])

 {

number obj= new number ();

obj.accept ();

obj.display ();

Output= Enter any number=8

1
10
11
100
101
110
111
1000
Q9=Design a class recursion –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int son (int i) =to return first n natural number using
recursive technique
Void display () = to display the sum
Ans= import java.util.*;
class recursion

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int son (int i)

{
 If (i<=n)

return (i+ son (++i));

else

return 0;

void display ()

int k=son (1);

System .out .println ("Sum is"+k);

public static void main (String args [])

recursion obj= new recursion ();

obj.accept ();

obj.display ();

}
Output= Enter any number
10

Sum is55
Enter any number
59
Sum is1770
Q10=Design a class function –
Data member /Instance variable
Int n, m- to store the number
Member functions
Void accept () = to input the number m and n
Int HCF (int x, int y) =to return the HCF of a parameter
Void display () = to display the HCF and LCM
Ans= import java.util.*;
class function

int n, m;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any two number");

n=sc.nextInt ();

m=sc.nextInt ();
}

int HCF (int a, int b)

{

while (a! =b)

if (a>b)

a=a-b;

else

b=b-a;

return a;

void display ()

int h= HCF (m, n);

int LCM= m*n/h;

System .out .println ("HCF is"+h);

System .out .println ("LCM is"+LCM);

}
public static void main (String args [])

function obj= new function ();

 obj.accept ();

obj.display ();

}
}

Output= Enter any two number

8
18
HCF is2
LCM is72
Enter any two number
24
12
HCF is12
LCM is24
 Programs from recursion
Q1=Design a class recursion –
Data member /Instance variable
Int n- to store the number
Member functions
Void input () = to input the number
Int product (int i) =to return the product of all natural
Number from 1 to n using recursive technique
Void display () = to display the product
Ans= import java.util.*;
class recursion
{

int i, n;

void input ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();
 }

int product (int i)

If (i<=n)

return (i* product (++i));

else

return 1;

void display ()

int k= product (1);

System .out .println ("Product is"+k);

public static void main (String args [])

recursion obj= new recursion ();

obj.input ();

obj.display ();

}
Output= Enter any number
8
Product is40320
Enter any number
5
Product is120
Q2=Design a class recursion –
Data member /Instance variable
Int n- to store the number
Member functions
Void input () = to input the number
Int fact (int x) =to return the factorial of parameter using
Recursive technique
Void display () = to display the sum of all factorial till n
Ans= import java.util.*;
class recursion
{

int n;

void input ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int fact (int x)

{

If(x>=1)

return (x* fact (--x));

else

return 1;
}

void display ()

int i, s=0;

for (i=1; i<=n; i++)

s=s+ fact (i);

System .out .println ("Sum is"+s);

public static void main (String args [])

recursion obj= new recursion ();

obj.input ();

obj.display ();
}

Output= Enter any number

14
Sum is 561012199
Enter any number
6
Sum is 873
Q3=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void getdata () = to input the number
Int sod (int x) =to return the sum of all digits of parameter
Using recursive technique
Void display () = to display the sum
Ans= import java.util.*;
class number
{

int n;

void getdata ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int sod (int x)

 {

If(x==0)

return 0;

else

return (x%10 + sod (x/ 10));

}

void display ()

int k= sod (n);

System .out .println ("Sum of all digits are"+k);

public static void main (String args [])

number obj= new number ();

obj.getdata ();

obj.display ();

}
Output=Enter any number
123
Sum of all digits are 6
Enter any number
5555
Sum of all digits are 20
Q4=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void getdata () = to input the number
Int countdigit (int x) =to return total number of digits in a
Parameter using recursive technique
Void display () = to check whether the number is dissarium
Number or not
Ans= import java.util.*;
class number

int n;

void getdata ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

}
int countdigit (int x)

If (x==0)

return 0;

else

return (1+ countdigit (x/ 10));

void display ()

int k= countdigit (n);

int b=n,r;

double s=0;

while (b>0)

r=b%10;

s=s + Math.pow(r, k);

k--;

b=b/10;

if(s==n)
 System .out .println ("Dissarium number");

else

System .out .println ("Not a Dissarium number");

}

public static void main (String args [])

number obj= new number ();

obj.getdata ();

obj.display ();
}

Output= Enter any number

135
Dissarium number
Enter any number
535
Not a Dissarium number
Q5=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int countzero (int x) =to return frequency of zero using
Recursive technique
Void display () = to check whether the number is duck
Number or not
Ans= import java.util.*;
class number

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

}
int countzero (int x)

if(x==0)

return 0;

else

if (x% 10 == 0)

return (1+ countzero (x/ 10));

else

return (0+ countzero (x/ 10));

void display ()

int k= countzero (n);

if (k>=1)

System .out .println ("Duck number");

else

System .out .println ("Not a Duck number");

}
 public static void main (String args [])

number obj= new number ();

obj.accept ();

obj.display ();
}

Output= Enter any number

3009
Duck number
Enter any number
429
Not a Duck number
Q6=Design a class number –
Data member /Instance variable
Int n- to store the number
Member functions
Void accept () = to input the number
Int countfactor (int x, int y) =to return factors of one
Parameter using Recursive technique
Void display () = to display all prime number from 1 to n
Ans= import java.util.*;
class number
{

int n;

void accept ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any number");

n=sc.nextInt ();

int countfactor (int i, int x)

{

if (i<=x)

if (x% i== 0)

return (1+ countfactor (++i,x));

else

return (0+ countfactor (++i,x));

else

return 0;

}
void display ()

for ( int i=1; i<=n; i++)

int k= countfactor (1, i);

if (k==2)

System .out .println (i);

}
 public static void main (String args [])

number obj= new number ();

obj.accept ();

obj.display ();
}

Output= Enter any number=15

2
3
5
7
11
13
Q7=Design a class series –
Data member /Instance variable
Int n, a- to store the numbers
Member functions
Void input () = to input the value of a and n
Int fact (int x) =to return factorial of a number using
Recursive technique
Int calpower (int x, int y) = to calculate x^y without
Math.pow and using recursive technique
Void display () = to display the sum of given series
= a^2/1! + a^4/2! + a^6/3! -------n times
Ans= import java.util.*;
class series
{

int n, a;

void input ()

Scanner sc= new Scanner (System .in);

System .out .println ("Enter any two number");

n= sc.nextInt ();

a= sc.nextInt ();

}
int fact (int x)

If (x>=1)

return (x* fact (--x));

else

return 1;

int calpower (int x, int y)

If (y>=1)

return (x* calpower (x, --y));

else

return 1;

void display ()

int i;
 double s=0;

for (i=1; i<=n; i++)

s=s+ calpower (a, i*2)/fact (i);

System .out .println ("Sum is"+s);

public static void main (String args [])

{

series obj= new series ();

obj.input ();

obj.display ();

}
Output = Enter any two number
5

2
Sum is40.0
Enter any two number
12
8
Sum is9692700.0
Q8=Design a class recur –
Data member /Instance variable
Int n- to store the number
Member functions
Void input () = to input the value of n
Int HCF (int a, int b) =to calculate HCF of a number using
Recursive technique
Void display () = to display the HCF
Ans=import java.util.*;
class recur
{

int a, b;

void input ()

{
Scanner sc= new Scanner (System .in);

System .out .println ("Enter any two numbers");

a= sc.nextInt ();

b= sc.nextInt ();

}
int HCF (int a, int b)

if (b>a)

a=a+b;

b=a-b;

a=a-b;

if (a%b ==0)

return b;

return HCF (b, a%b);

}

void display ()

int h =HCF (a, b);

System .out .println ("HCH is"+h);

public static void main (String args [])

recur obj= new recur ();

 obj. Input ();

obj.display ();

}
}

Output=Enter any two numbers

8
18
HCH is 2
Enter any two numbers
24
12
HCH is 12
Q9= Design a function count and count how many vowels are
There in a word using recursion
Ans= import java.util.*;
class count

Int count (String wd)

If(wd.length () <=0)

Return 0;

Else if (wd.lenth () ==1)

If (“AEIOUaeiou”.indexOf (wd.charAt (0))>=0)

Return !;

Else

If (“AEIOUaeiou”.indexOf (wd.charAt (0)) <=0)

Return (1+ count (wd.substring (1)));

Else

Return (0+ count (wd.substring (1)));

}
Q10=Design a class to check if a program is palindrome or not.

Ans=import java .util.*;

class palin
{

String s;

String accept ()

System .out. println (“Enter any word”);

s= sc.next ();

Boolean IS palin (String wd)

If (wd. length () <=1)

Return true;

Else
{

If (wd.charAt (0)! = wd.charAt (wd.length ()-1))

Return false;

Return IS palin (wd.substring (1, wd.length () - 1) +””);

}}}
Programs from File Handling
Q1=Write a program in java and create a text file about me and
write the information in the file
Ans=import java.util.*;
class abc
{
public static void main (String args [])
{
FileWriter FW = new FileWriter (“about me”);
BufferedWriter BR = new BufferedWriter (FW);
PrintWriter PW = new PrintWriter (BR);
PW.println (“Name = Riya Raturi”);
PW.println (“Class= 11; Section = A”);
PW.println (“Hobby = Book Reading”);
BR.close ();
PW.close ();
}
}
Q2=Write a program to input a file name from user and print
the file data and also print total number of characters in a file.
Ans=import java.util*;
Import java.io*;
class filename
{
public static void main (String args []) throws IOException
{
String FN;
Scanner sc= new Scanner (System.in)
System.out.println (“Enter file name”);
FN= sc.nextline ();
int ct=0;
FileReader FR = new FileReader (FN);
BufferedReader BR = new BufferedReader (FR);
String line= BR.readLine ();
while (line! = null)
{
System.out.println (line);
ct++= lineLength ();
Line = BR.readLine ();

}
System.out.println (“Total number of characters”+ct);
BR.close ();
FR.close ();
}
}
Q3=Write a program and input a file name from user and print
each line along with number of words in the line and at the end
also print total number of words.
Ans= import java.util*;
Import java.io*;
class program
{
public static void main (String args []) throws IOException
{
String FN;
Scanner sc= new Scanner (System.in)
System.out.println (“Enter file name”);
FN= sc.nextline ();
FileReader FR = new FileReader (FN);
BufferedReader BR = new BufferedReader (FR);
String line= BR.readLine ();
while (line! = null)
{
int c= 0;
For (int i=0; i< line.length (); i++)
{
If (line.charAt (i) ==’ ‘)
C++;
}
System.out.println (line+ /+ “Number of words” + (c+ 1));
ct= ct+ (c+1);
Line = BR.readLine ();
}
System.out.println (“Total number of words”+ct);
BR.close ();
FR.close ();
}
}
Q4=Write a program and write class test marks in a file T marks.
Input subject name and marks from user
Ans= import java.util*;
Import java.io*;
class testmarks
{
public static void main (String args []) throws IOException
{
FileOutputStream fos= new FileOutputStream (“ct marks.
data”);
DataOutputStream dos= new DataOutputStream (fos);
Scanner sc= new Scanner (System.in);
String subname;
Int submo;
for (i=0; i<6; i++)
{
System.out.println (“Enter subject name”);
subname= sc.nextline ();
System.out.println (“Enter marks”);
submo= sc.nextInt ();
dos.writeUTF (subname);
dos.writeInt (submo);
}
dos.close ();
fos.close ();
}
}
Q5=Write a program and input n employees detail from user
and write in a file emp.dat and details like employees basic
salary, age, id.
Ans= import java.util*;
Import java.io*;
class testmarks
{
public static void main (String args []) throws IOException
{
FileOutputStream fos= new FileOutputStream (“detail. dat”);
DataOutputStream dos= new DataOutputStream (fos);
Scanner sc= new Scanner (System.in);
String name, gender;
Int id, age, salary;
for (i=0; i<=5; i++)
{
System.out.println (“Enter name”);
name= sc.nextline ();

System.out.println (“Enter gender”);

gender= sc.nextline ();
System.out.println (“Enter age”);
age= sc.nextInt ();
System.out.println (“Enter salary”);
salary= sc.nextInt ();
System.out.println (“Enter id”);
id= sc.nextInt ();
dos.writeUTF (name);
dos.writeUTF (gender);
dos.writeInt (age);
dos.writeInt (id);
dos.writeInt (salary);
}
dos.close ();
fos.close ();
}
}
Q6=Write a program and read class test mast in a file T marks.
Input subject name and marks from user.
Ans= import java.util*;
Import java.io*;
class readtestmarks
{
public static void main (String args []) throws IOException
{
int mk;
String subname;
FileInputStream fis= new FileInputStream (“ctmarks. dat”);
DataInputStream dos= new DataInputStream (fis);
Scanner sc= new Scanner (System.in);
Boolean eof= false;
while (! eof)
{
try
{
subname= dis.readUTF ();
Mk= dis.readInt ();

System.out.println (subname+”-” +mk);

}
catch (“eof Exception eo”)
{
eof= true;
}
}
dis.close ();
fis.close ();
}
}
Q7=Write a program to input a cricketer information from user
and write data in a file crickinfo.dat. Make another function
read info and print into screen .Cricketer – name, country, no of
match played by him, no of centuries, no of runs, no of over
bowled, no of wickets taken.
Ans= import java.util*;
Import java.io*;
class crickinfo
{
public static void main (String args []) throws IOException
{
int mp, nc, nr, no, nw;
String cn, con;
FileInputStream fis= new FileInputStream (“crickinfo. dat”);
DataInputStream dos= new DataInputStream (fis);
Scanner sc= new Scanner (System.in);
Boolean eof= false;
while (! eof)
{
try
{
cn name= dis.readUTF ();
con name= dis.readUTF ();
mp= dis.readInt ();
nc= dis.readInt ();
nr= dis.readInt ();
no= dis.readInt ();
nw= dis.readInt ();
System.out.println (cn+””+con+””+mp+””+nc+””+nr+””+no+””+
nw);

}
catch (“eof Exception eo”)
{
eof= true;
}
}
dis.close ();
fis.close ();
}
}
Q8=Write a program to count and print only palindrome words.
Ans= = import java.util*;
Import java.io*;
class program
{
public static void main (String args []) throws IOException
{
Scanner sc= new Scanner (System.in);
String s, wd, rwd;
int c=0;
System.out.println (“Enter any sentence”);
s=sc.nextLine ();
String Tokenizer st= new String Tokenizer(s);
int ct= st.countTokens ();
for (i=0; i<ct; i++)
{
wd= st. countTokens ();
rwd= new StringBuffered (wd). reverse (). toString ();
if (wd.equal (rwd))
{
System.out.println (wd);
c++;
}
}
System.out.println (“Number of palindrome words”+c);
}
}
Q9=Write a program to input a string and print the longest
word of the string
Ans= import java.util*;
Import java.io*;
class program
{
public static void main (String args []) throws IOException
{
Scanner sc= new Scanner (System.in);
String s, wd, rwd;
int c=0;
System.out.println (“Enter any sentence”);
s=sc.nextLine ();
String Tokenizer st= new String Tokenizer(s);
int ct= st.countToken ();
rwd=””;
for (i=0; i<ct; i++)
{
wd= st. countToken ();
if (wd.length () > rwd. length ())
rwd=wd;

}
System.out.println (“Longest word=”+rwd);
}
}
Q10=Write a program to input a string count and print total
number of vowels and number of palindrome words also print
the palindrome words.
Ans= import java.util*;
Import java.io*;
class text
{
String str;
public text ();
{
str=””;
}
public void input ()
{
Scanner sc= new Scanner (System.in);
System.out.println (“Enter any sentence”);
str=sc.nextLine ();
}
public booleanisPalin (String wd)
{
If (wd.length () <=1)
return true;

else
{
If (wd.charAt (0)! =wd.charAt (wd.length () - 1))
return false;
returnisPalin (wd.substring (1, wd.length ()-1+””) ;
}
}
public int count vol (String wd)
{
if (wd.length () <=0)
return 0;
else if (wd.length () == 1)
{
if (“AEIOUaeiou”. indexOf (wd.charAt (0)>=0));
return!;
else
If (“AEIOUaeiou”. indexOf (wd.charAt (0)>=0));
return (1+ count (wd.substring (1)));

else
return (0+ count (wd.substring (1)));
}
}
public void show ()
{
Int nv= countvol(s+r);
System.out.println (“Number of vowels=” +nv);
String Tokenizer s + k= new String Tokenizer(s+r);
int ct= s+k.countToken ();
String w;
for (i=1; i<=ct; i++)
{
w= s+ k. nextToken ();
if (isPalin (w))
System.out.println (w);
}
}
public static void main (String args [])
{
text obj= new text ();
obj. Input ();
obj.show ();
}
}
 Conclusion
In the end, I would like to say that this is a very interesting
project. I have gained a lot of knowledge about this topic. I am
also very grateful to my friends, parents and teachers for the
valuable and precious support which they all have provided me.
 Bibliography
I have used the following sources for this project.
(1)Computer Science with java ISC
(2)Knowledge Boat