ANNAMALAIAR COLLEGE OF ENGINEERING

Mudaiyur-606902

DEPARTMENT OF _______________________________

CS3381 – OBJECT ORIENTED PROGRAMMING

LABORATORY

Name ………………………………………………………

Roll No …………….. Register No ………..……………..

Year ………………….. Semester ………….……………

 Register No.: _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

BONAFIDE CERTIFICATE

Certified to be the bonafide record work done by

Mr. / Ms. ……………………………..……... of..................Semester,
B.E.,/[Link] .………….……...…………….…… in the CS3381 – OBJECT
ORIENTED PROGRAMMING LABORATORY practical course during
the academic year 2024 – 2025.

Faculty in-Charge Head of the Department

Submitted for the Anna University Practical Examination held on

…........................at Annamalaiar College of Engineering, Modaiyur.

Internal Examiner External Examiner

EX. PAGE
DATE NAME OF THE EXPERIMENT INITIAL
NO NO
1(a) LINEAR SEARCH

1(b) BINARY SEARCH

1(c) SELECTION SORT

1(d) INSERTION SORT

2(a) STACK OPERATIONS

2(b) QUEUE OPERATIONS

3 PAYSLIP GENERATION USING INHERITANCE

4 ABSTRACT CLASS IMPLEMENTATION

5 INTERFACE CONCEPTS

6(a) EXCEPTION HANDLING

6(b) USER DEFINED EXCEPTION

7 MULTITHREADING IMPLEMENTATION
8(a) FILE OPERATION
8(b) COUNT THE WORDS IN A FILE
9 GENERIC CLASSES
10(a) JavaFX Control

10(b) LAYOUTS

10(c) MENUS
 1(A) LINEAR SEARCH

AIM:

To write a java program using linear search

ALGORITHMS:

1. Start the program

2. Declare the necessary variable for linear search program
3. After that Find() methods are used to return the position of the element stored location.
4. Print the output of the program
5. Stop the program
PROGRAM:

class LinearSearch

public static void main(String args[])

int a[]={1,5,-2,8,7,11,40,32};

[Link](“the element is at location “+Find(a,7));

[Link](“the element is at location “+Find(a,11));

public static int Find(int a[], int key)

int i;

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

if(a[i] = = key)

return i+1;

return -1;

}
Output:

The element is at location 5

The element is at location 6

RESULT:

Thus the java program for linear search program has been implemented and executed
successfully.
 1(b) BINARY SEARCH

AIM:

To write a java program using Binary search

ALGORITHMS:

1. Start the program

2. Declare the necessary variable for binary search program
3. Find() methods are used to return the position of the elements on stored elements
4. Print the output of the program
5. Stop the program
PROGRAM:

class BinarySearch

public static void main(String args[])

int[] a= {10,20,30,40,50,60};

int key=40;

Find(a,0,5,key);

public static void Find(int[] a, int low, int high, int key)

int mid;

if(low>high)

[Link](“Error! The element is not present in the list”);

return;

mid=(low+high)/2;

if(key= = a[mid])

[Link](“the element is present at loaction” +(mid+1));

else if(key<a[mid])

Find(a,low,mid-1,key);

else if(key>a[mid])

Find (a,mid+1,high,key);

}
OUTPUT:

The element is present at loaction 4

RESULT:

Thus the java program for Binary search program has been implemented and executed
successfully.
 1(c) SELECTION SORT

AIM:

To write a java program for Selection sort using quadratic sorting algorithms

ALGORITHMS:

1. Start the program

2. Initialize minimum value(min_idx) to location 0.
3. Traverse the array to find the minimum element in the array.
4. While traversing if any element smaller than min_idx is found then swap both the values.
5. Then, increment min_idx to point to the next element.
6. Repeat until the array is sorted.
7. Stop the program
PROGRAM:

import [Link].*;
class Selectionsort
{
void sort(int arr[])
{
int n=[Link];
for (int i = 0; i < n-1; i++)
{
int = i;
for (int j = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
}
void printArray(int arr[])
{
int n = [Link];
for (int i=0; i<n; ++i)
[Link](arr[i]+" ");
[Link]();
}
public static void main(String args[])
{
SelectionSort ob = new SelectionSort();
int arr[] = {64,25,12,22,11};
[Link](arr);
[Link]("Sorted array");
[Link](arr);
}
}
OUTPUT:

Sorted Array: 11, 12,22,25,64

RESULT:

Thus the java program for selection sort program using quadratic sorting algorithms has been
implemented and executed successfully.
 1(D) INSERTION SORT

AIM:

To write a java program for Selection sort using quadratic sorting algorithms.

ALGORITHMS:

1. Start the program to sort an array of size N in ascending order:

2. Iterate from arr[1] to arr[N] over the array.
3. Compare the current element (key) to its predecessor.
4. If the key element is smaller than its predecessor, compare it to the elements before.
5. Move the greater elements one position up to make space for the swapped element.
6. Print the output of insertion sort
7. Stop the program
PROGRAM:

class InsertionSort
{
void sort(int arr[])
{
int n = [Link];
for (int i = 1; i < n; ++i)
{
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key)
{
arr[j + 1] =
arr[j]; j = j - 1;
}
arr[j + 1] = key;
}
}

static void printArray(int arr[])

{
int n = [Link];
for (int i = 0; i < n; ++i)
[Link](arr[i] + " ");
[Link]();
}
public static void main(String args[])
{
int arr[] = { 12, 11, 13, 5, 6 };
InsertionSort ob = new InsertionSort();
[Link](arr);
printArray(arr);
}
}
OUTPUT:

5 6 11 12 13

RESULT:

Thus the java program for insertion sort program using quadratic sorting algorithms has been
implemented and executed successfully.

.
 2(A) STACK OPERATIONS

AIM:
To develop a java program for stack data structure using class and object

ALGORITHMS:

1. Start the program

2. Declare the necessary variables of stack program
3. push inserts an item at the top of the stack (i.e., above its current top element).
4. pop removes the object at the top of the stack and returns that object from the function.
The stack size will be decremented by one.
5. isEmpty tests if the stack is empty or not.
6. isFull tests if the stack is full or not.
7. peek returns the object at the top of the stack without removing it from the stack or
modifying the stack in any way.
8. Print size returns the total number of elements present in the stack.
9. Stop the program
PROGRAM:

class Stack
{
private int arr[];
private int top;
private int capacity;
Stack(int size)
{
arr = new
int[size]; capacity
= size; top = -1;
}
public void push(int x)
{
if (isFull())
{
[Link]("Overflow\nProgram Terminated\
n"); [Link](-1);
}
[Link]("Inserting " + x);
arr[++top] = x;
}
public int pop()
{
if (isEmpty())
{
[Link]("Underflow\nProgram
Terminated"); [Link](-1);
}
[Link]("Removing " + peek());
return arr[top--];
}
 public int peek()
{
if (!isEmpty())
{
return arr[top];
}
else {
[Link](-1);
}
return -1;
}
public int size()
{
return top + 1;
}

public boolean isEmpty()

{
return top == -1; // or return size() == 0;
}
public boolean isFull()
{
return top == capacity - 1; // or return size() == capacity;
}
}

class Main
{
public static void main (String[] args)
{
Stack stack = new Stack(3);
[Link](1); // inserting 1 in the stack
[Link](2); // inserting 2 in the stack
[Link](); // removing the top element
(2) [Link](); // removing the top element (1)
[Link](3); // inserting 3 in the stack
 [Link]("The top element is " +
[Link]()); [Link]("The stack size is " +
[Link]()); [Link](); // removing the top
element (3)
if ([Link]())
{
[Link]("The stack is empty");
}
else
{
[Link]("The stack is not empty");
}
}
}
OUTPUT:

Inserting 1
Inserting 2
Removing 2
Removing 1
Inserting 3
The top element is 3
The stack size is 1
Removing 3
The stack is empty

RESULT:

Thus the java program for stack data structure using class and object has been implemented and
executed successfully.
 2(B) QUEUE OPERATIONS

AIM:

To develop a java program for Queue data structure using class and object

ALGORITHMS:

Queue operations work as follows:

1. Two pointers FRONT and REAR

2. FRONT track the first element of the queue
3. REAR track the last element of the queue
4. initially, set value of FRONT and REAR to -1

Enqueue Operation:

1. check if the queue is full

2. for the first element, set the value of FRONT to 0
3. increase the REAR index by 1
4. add the new element in the position pointed to by REAR

Dequeue Operation:

1. check if the queue is empty

2. return the value pointed by FRONT
3. increase the FRONT index by 1
4. for the last element, reset the values of FRONT and REAR to -1
PROGRAM:

public class Queue

{
int SIZE = 5;
int items[] = new int[SIZE];
int front, rear;
Queue()
{
front = -1;
rear = -1;
}
boolean isFull()
{
if (front == 0 && rear == SIZE - 1)
{
return true;
}
return false;
}
boolean isEmpty()
{
if (front == -
1) return true;
else
return false;
}
void enQueue(int element)
{
if (isFull())
{
[Link]("Queue is full");
}
Else
{
 if (front == -1)
front = 0; rear+
+;
items[rear] = element;
[Link]("Inserted " + element);
}
}

int deQueue()
{
int element;
if (isEmpty())
{
[Link]("Queue is empty");
return (-1);
}
else
{
element = items[front];
if (front >= rear)
{
front = -1;
rear = -1;
}
else
{
front++;
}
[Link]("Deleted -> " + element);
return (element);
}
}
void display()
{
int i;
if (isEmpty())
{
[Link]("Empty Queue");
}
else
{
[Link]("\nFront index-> " + front);
[Link]("Items -> ");
for (i = front; i <= rear; i++)
[Link](items[i] + " ");
[Link]("\nRear index-> " + rear);
}
}
public static void main(String[] args)
{
Queue q = new Queue();
[Link]();
[Link](1);
[Link](2);
[Link](3);
[Link](4);
[Link](5);
[Link](6);
[Link]();
[Link]();
[Link]();
}
}
OUTPUT:

2 3 4 5 6

RESULT:

Thus the java program for queue data structure using class and object has been implemented and
executed successfully.
 3. PAYSLIP GENERATION USING INHERITANCE

AIM:

To develop a java application to generate pay slip for different category of employee using the
concepts of inheritance.

ALGORITHMS:

1. Start the program

2. Create the class employee with name, empid,address, mailid, mobile no as data members
3. Inherit the classes programmer, asstprofessor, associateprofessor and professor from
employee class
4. Add basic pay(bp) as data member of all the ibherited classes
5. Calculate DA as 97% bp,HRA, 10% of BP, PF as 12% BP staff club fund as 0.1% of BP.
6. Calculate gross salary and net salary
7. Generate payslip for all categories of employee
8. Stop the program
PROGRAM:

[Link]

import [Link];

class Employee

int empid;

long mobile;

String name, address, mailid;

Scanner get = new Scanner([Link]);

void getdata()

[Link]("Enter Name of the Employee");

name = [Link]();

[Link]("Enter Mail id");

mailid = [Link]();

[Link]("Enter Address of the Employee:");

address = [Link]();

[Link]("Enter employee id ");

empid = [Link]();

[Link]("Enter Mobile Number");

mobile = [Link]();

void display()

[Link]("Employee Name: "+name);

[Link]("Employee id : "+empid);

[Link]("Mail id : "+mailid);

[Link]("Address: "+address);
[Link]("Mobile Number: "+mobile);

class Programmer extends Employee

double salary,bp,da,hra,pf,club,net,gross;

void getprogrammer()

[Link]("Enter basic pay");

bp = [Link]();

void calculateprog()

da=(0.97*bp);

hra=(0.10*bp);

pf=(0.12*bp);

club=(0.1*bp);

gross=(bp+da+hra);

net=(gross-pf-club);

[Link]("********************************************");

[Link]("PAY SLIP FOR PROGRAMMER");

[Link]("********************************************");

[Link]("Basic Pay: Rs. "+bp);

[Link]("DA: Rs. "+da);

[Link]("HRA: Rs. "+hra);

[Link]("PF: Rs. "+pf);

[Link]("CLUB: Rs. "+club);

[Link]("GROSS PAY: Rs. "+gross);

[Link]("NET PAY: Rs. "+net);

}
}

class Asstprofessor extends Employee

double salary,bp,da,hra,pf,club,net,gross;

void getasst()

[Link]("Enter basic pay");

bp = [Link]();

void calculateasst()

da=(0.97*bp);

hra=(0.10*bp);

pf=(0.12*bp);

club=(0.1*bp);

gross=(bp+da+hra);

net=(gross-pf-club);

[Link]("***********************************");

[Link]("PAY SLIP FOR ASSISTANT PROFESSOR");

[Link]("***********************************");

[Link]("Basic Pay: Rs. "+bp);

[Link]("DA: Rs. "+da);

[Link]("HRA: Rs. "+hra);

[Link]("PF: Rs. "+pf);

[Link]("CLUB: Rs. "+club);

[Link]("GROSS PAY: Rs. "+gross);

[Link]("NET PAY: Rs. "+net);

}
class Associateprofessor extends Employee

double salary,bp,da,hra,pf,club,net,gross;

void getassociate()

[Link]("Enter basic pay");

bp = [Link]();

void calculateassociate()

da=(0.97*bp);

hra=(0.10*bp);

pf=(0.12*bp);

club=(0.1*bp);

gross=(bp+da+hra);

net=(gross-pf-club);

[Link]("***********************************");

[Link]("PAY SLIP FOR ASSOCIATE PROFESSOR");

[Link]("***********************************");

[Link]("Basic Pay: Rs. "+bp);

[Link]("DA: Rs. "+da);

[Link]("HRA: Rs. "+hra);

[Link]("PF: Rs. "+pf);

[Link]("CLUB: Rs. "+club);

[Link]("GROSS PAY: Rs. "+gross);

[Link]("NET PAY: Rs. "+net);

}
class Professor extends Employee

double salary,bp,da,hra,pf,club,net,gross;

void getprofessor()

[Link]("Enter basic pay");

bp = [Link]();

void calculateprofessor()

da=(0.97*bp);

hra=(0.10*bp);

pf=(0.12*bp);

club=(0.1*bp);

gross=(bp+da+hra);

net=(gross-pf-club);

[Link]("************************");

[Link]("PAY SLIP FOR PROFESSOR");

[Link]("************************");

[Link]("Basic Pay: Rs. "+bp);

[Link]("DA: Rs. "+da);

[Link]("HRA: Rs. "+hra);

[Link]("PF: Rs. "+pf);

[Link]("CLUB: Rs. "+club);

[Link]("GROSS PAY: Rs. "+gross);

[Link]("NET PAY: Rs. "+net);

}
class Salary

public static void main(String args[])

int choice,cont;

do

[Link]("PAYROLL");

[Link](" [Link] \t [Link] PROFESSOR \t [Link]

PROFESSOR \t [Link] ");

Scanner c = new Scanner([Link]);

[Link](“Enter Your Choice:”);

choice=[Link]();

switch(choice)

case 1:

Programmer p=new programmer();

[Link]();

[Link]();

[Link]();

[Link]();

break;

case 2:

Asstprofessor asst = new Asstprofessor();

[Link]();

[Link]();

[Link]();
[Link]();

break;

case 3:

Associateprofessor asso = new Associateprofessor();

[Link]();

[Link]();

[Link]();

[Link]();

break;

case 4:

professor prof = new

professor(); [Link]();

[Link]();

[Link]();

[Link]();

break;

[Link](“please enter 0 to quit and 1 to continue”);

cont=[Link]();

while(con= = 1);

}
OUTPUT:

RESULT:

Thus the java application to generate pay slip for different category of employee has been
implemented using inheritance and the program was executed successfully.
 4. ABSTRACT CLASS IMPLEMENTATION

AIM:

To write a java program to create an abstract class

ALGORITHMS:

1. Start the program

2. Declare the necessary variable for class shapes
3. Declare the abstarct printarea() method in abstarct shape class
4. Classes are created as rectangle, triangle and circle classes that classes inherits from shape
using extends keyword
5. Define the definition part of printarea in rectangel class, triangle class and circle class
6. Calculate of rectangle area, triangle area and circle area using the printarea() method
7. Print the outputs
8. Stop the program
PROGRAM:
import [Link].*;
abstract class shape
{
int a,b;
abstract public void printarea();
}
class rectangle extends shape
{
public int area_rect;
public void
printarea()
{
Scanner s=new Scanner([Link]);
[Link]("Enter the length and breadth of rectangle");
a=[Link]();
b=[Link]();
area_rect=a*b;
[Link]("Length of rectangle: "+a +"breadth of rectangle: "+b);
[Link]("The area of rectangle is:"+area_rect);
}
}
class triangle extends shape
{
double area_tri; public
void printarea()
{
Scanner s=new Scanner([Link]);
[Link]("Enter the base and height of triangle:");
a=[Link]();
b=[Link]();
[Link]("Base of triangle: "+a +"height of triangle: "+b);
area_tri=(0.5*a*b);
[Link]("The area of triangle is:"+area_tri);
}
}
class circle extends shape
{
double area_circle;
public void
printarea()
{
Scanner s=new Scanner([Link]);
[Link]("Enter the radius of circle:");
a=[Link]();
area_circle=(3.14*a*a);
[Link]("Radius of circle:"+a);
[Link]("The area of circle is:"+area_circle);
}
}

public class Shapeclass

{
public static void main(String[] args)
{
rectangle r=new rectangle();
[Link]();
triangle t=new triangle();
[Link]();
circle r1=new circle();
[Link]();
}
}
OUTPUT:

Enter the length and breadth of rectangle

10
20
Length of rectangle:10
breadth of rectangle: 20
The area of rectangle is:
200

Enter the base and height of triangle:

10
20
Base of triangle: 10
height of triangle: 20
The area of triangle is: 100

Enter the radius of circle: 15

Radius of circle: 15
The area of circle is: 706.5

RESULT:

Thus the java program for abstract class has been implemented and executed
successfully.
 5. INTERFACE CONCEPTS

AIM:

To write a java program using interface concepts

ALGORITHMS:

1. Start the program

2. Defining the interface
3. Declare the necessary variable for class shapes
4. Declare the abstarct printarea() method in abstarct shape class
5. Classes are created as rectangle, triangle and circle classes that classes inherits from shape
using implements interface.
6. Define the definition part of printarea in rectangel class, triangle class and circle class
7. Calculate of rectangle area, triangle area and circle area using the printarea() method
8. Print the outputs
9. Stop the program
PROGRAM:

import [Link].*;
interface myinterface
{
public void printarea();
}
abstract class shapes
{
double a,b;
abstract void printarea();
}
class rectangle extends shapes implements myinterface
{
public void printarea()
{
[Link](“calculating area of rectangle”);
Scanner input=new Scanner([Link]);
[Link](“enter length:”);
a=[Link]();
[Link](“enter breadth:”);
b=[Link]();
double area=a*b;
[Link](“ area od rectangle:”+area);
}
}
class triangle extends shapes implements myinterface
{
[Link](“calculating area of triangle”);
Scanner input=new Scanner([Link]);
[Link](“enter height:”);
a=[Link]();
[Link](“enter breadth:”);
b=[Link]();
double area=0.5*a*b;
[Link](“ area od triangle:”+area);
}
}
class circle extends shapes implements myinterface
{
[Link](“calculating area of circle”);
Scanner input=new Scanner([Link]);
[Link](“enter radius:”);
a=[Link]();
double area=3.14*a*a;
[Link](“ area od
circle:”+area);
}
}
class abstractclassdemo
{
public static void main(String args[])
{
shapes obj;
obj=new rectangle();
[Link]();
obj=new triangle();
[Link]();
obj=newcircle();
[Link]();
}
}
OUTPUT:

Calculating area of rectangle

Enter length: 10

Enter breadth: 20

Area of rectangle : 200.0

Calculating area of triangle

Enter height: 10

Enter breadth: 5

Area of triangle : 25.0

Calculating area of circle

Enter radius: 10

Area of rectangle : 314.0

RESULT:

Thus the java program for interface concept has been implemented and executed
successfully.
 6(a) EXCEPTION HANDLING

AIM:

To develop a java program using exception handling

ALGORITHMS:

1. Start the program

2. Declare the necessary variables for exception handling program
3. Define the try – catch block for handling the exception
4. Try block is used to try block of source code that is to be monitored for the exception.
5. Catch block is used to handles the specific type of exception along with the try block.
6. Print the exception information using printStackTrace() method
7. Stop the program
PROGRAM:

import [Link].*;
class GFG
{
public static void main (String[] args)
{
int a=5;
int b=0;
try
{
[Link](a/b);
}
catch(ArithmeticException e)
{
[Link]();
}
}
}
 OUTPUT:

[Link]: Division by zero at [Link]([Link])

RESULT:

Thus the java program for exception handling has been implemented and executed
successfully.
 6(b) USER DEFINED EXCEPTION

AIM:

To develop a java program using User defined Exception

ALGORITHMS:

1. Start the program

2. Declare the necessary variables for user defined exception program
3. Initialize the values using Constructor method.
4. Define the try – catch block for handling the exception
5. Try block is used to try block of source code that is to be monitored for the exception.
6. Catch block is used to handles the specific type of exception along with the try block.
7. Print the output
8. Stop the program
PROGRAM :

class MyException extends Exception

String str1;
MyException(String str2)

str1=str2;

public String toString()

return ("MyException Occurred: "+str1) ;

class example

public static void main(String args[])

try

{
[Link]("Starting of try block");

throw new MyException("This is My error Message");

}

catch(MyException exp)

[Link]("Catch Block") ;
[Link](exp) ;

}
OUTPUT:

Starting of try block

Catch Block

Myexception Occurred: this is my error Message

RESULT:

Thus the java program for user defined exception handling has been implemented and
executed successfully.
 7. MULTITHREADING IMPLEMENTATION

AIM:

To develop a java program using Multithreading implementation

ALGORITHMS:

1. Start the program

2. Create a class even which implements first thread that compute the square of the number
3. Run() method implements the code to be excuted when thread gets executed.
4. Create a class odd which implements seconf thread that computes the cube of the number.
5. Create the third thread that generates random number. If the random number is even it display
the square of the number. If the random number is odd, it display the cube of given number.
6. The multithreading is performed and the task switched between multiple thread.
7. The sleep() method makes the thread to suspend for the specified time.
8. Stop the program
PROGRAM:

import [Link].*;
class even implements Runnable

{
public int x;
public even(int x)
{
this.x = x;
}
public void run()
{
[Link]("New Thread "+ x +" is EVEN and Square of " + x + " is: " + x * x);
}
}
class odd implements Runnable
{
public int x;
public odd(int
x)
{
this.x = x;
}
public void run()
{
[Link]("New Thread "+ x +" is ODD and Cube of " + x + " is: " + x * x * x);
}
}
class A extends Thread
{
public void run()
{
int num = 0;
Random r = new Random();
try
{
for (int i = 0; i < 5; i++)
{
num = [Link](100);
[Link]("Main Thread and Generated Number is " + num);
if (num % 2 == 0)
{
Thread t1 = new Thread(new even(num));
[Link]();
}
else
{
Thread t2 = new Thread(new odd(num));

[Link]();
}
 [Link](1000);
[Link](" ");
}
}
catch (Exception ex)
{
[Link]([Link]());
}
}
}

public class multithreadprog

{
public static void main(String[] args)
{
A a = new A();
[Link]();
}
}
OUTPUT :

Main thread and Generated Number is 37

New Thread 37 is ODD and Cube of 37 is : 50653

Main thread and Generated Number is 4

New Thread 4 is EVEN and Square of 4 is : 16

Main thread and Generated Number is 69

New Thread 69 is ODD and Cube of 69 is : 328509

Main thread and Generated Number is 32

New Thread 32 is EVEN and Square of 32 is : 1024

Main thread and Generated Number is 26

New Thread 26 is EVEN and Square of 26 is : 676

RESULT:

Thus the java program for multithreaded has been implemented and executed
successfully.
 8(A) FILE OPERATION

AIM:

To develop a java program that copies the content of one file to another file by removing
unnecessary spaces between words.

ALGORITHMS:

1. Start the program

2. Declare the necessary classes for file operation.
3. Read() method is used to read the byte of data
4. Write () method is used to write the byte of data
5. Close () method is used to close the stream.
6. Get the source file name and destination file name using Scanner and File Classes
7. CopyContent() method called to copy the contents from one file to another file
8. Stop the program
PROGRAM:

import [Link].*;
import [Link].*;
public class CopyFromFileaToFileb
{
public static void copyContent(File a, File b) throws Exception
{
FileInputStream in = new FileInputStream(a);
FileOutputStream out = new FileOutputStream(b);
try
{
int n;
while ((n = [Link]()) != -1)
{
[Link](n);
}
}
finally
{
if (in != null)
{
[Link]();
}
if (out != null)
{
[Link]();
}
}
[Link]("File Copied");
}
 public static void main(String[] args) throws Exception
{
Scanner sc = new Scanner([Link]);
[Link]( "Enter the source filename from where you have to read/copy :");
String a = [Link]();
File x = new File(a);
[Link]( "Enter the destination filename where you have to write/paste :");
String b = [Link]();
File y = new File(b);
copyContent(x, y);
}
}
OUTPUT:

Enter the source filename from where you have to read/copy :

[Link]

Enter the destination filename where you have to write/paste :

[Link]

File Copied

RESULT:

Thus the java program copies the content of one file to another file has been implemented and
executed successfully.
 8(B) COUNT THE WORDS IN A FILE

AIM:

To develop a java program for count the words in a file using File Operations.

ALGORITHMS:

1. Start the program

2. Define String line
3. Set count =0
4. Use File Reader to open file in read mode
5. READ line from file
6. REPEAT STEP 7 to STEP 8 UNTIL reach the end of file
7. SPLIT lines into words and STORE in array string words[].
8. count = count + [Link]
9. print the Count of Words in a file.
10. Stop the progam
PROGRAM:

import [Link];
import [Link];
public class CountWordFile
{
public static void main(String[] args) throws Exception
{
String line;
int count = 0;
FileReader file = new FileReader("[Link] ");
BufferedReader br = new BufferedReader(file);
while((line = [Link]()) != null)
{
String words[] = [Link]("");
count = count + [Link];
}
[Link]("Number of words present in given file: " + count);
[Link]();
}
}
 OUTPUT:

Number of words present in given file: 60

RESULT:

Thus the java program to count the words in a file has been implemented and executed
successfully.
 9 GENERIC CLASSES

AIM:

To develop a java program using generic class.

ALGORITHMS:

1. Start the program

2. Define generic class
3. Constructor method will be ivoked from main
4. Define generic method for PUSH and POP operations inside the generic class
5. Declaring integer and character values to be pushed onto the stack.
6. Ist is an instance for integer stack and cst is an instance for character stack
7. The constructor stack(size) will be invoked
8. Pushing onto integer stack using push()
9. Pushing onto character stack using push()
10. Popping from the character using pop()
11. Popping from the integer using pop()
12. print the outputs
13. Stop the program
 PROGRAM 1:

mport [Link].*;

public class stack<T>

public arraylist<T> obj;

public stack(int size)

obj=new arraylist<T>(size);

public void push(T item)

[Link](item);

public T pop()

if([Link]())

[Link](“\n Stack is empty”);

return null;

return [Link]([Link]()-1);

}
 PROGRAM 2:

import [Link].*;

import [Link].*

public class stackgeneric

public static void main(String args[])

int[] ia={1,2,3,4,5};

char[] ca={‘A’,’B’,’C’,’D’,’E’};

stack<Integer> ist=new stack<Integer>(5);

stack<Character> ist=new stack<Character>(5);

[Link](“\n pushing the elements in integer stack”);

for(int i=0;i<5;i++)

[Link](ia[i]);

[Link](“\n pushing the elements in character stack”);

for(int i=0;i<5;i++)

[Link](ca[i]);

[Link](“\n popping the elements from Character stack”);

for(int i=0;i<2;i++)

[Link](“\n %c” ,[Link]());

[Link](“\n popping the elements from integer stack”);

for(int i=0;i<5;i++)

[Link](“\n %d”, [Link]());

[Link](“\n performing one more pop integer stack”);

[Link](“\n %d”, [Link]());

}
OUTPUT:

Pushing the elements in integer stack

Pushing the elements in character stack

Popping two elements from character stack

Popping all the elements from integer stack

Performing one more pop for integer stack

Stack is empty

Null

RESULT:

Thus the java program to generic class has been implemented and executed successfully.
 10.(a) JavaFX Control

AIM:

To write a javaFX application for creating a login form

ALGORITHMS:

1. Start the program

2. Declare the necessary packages for the progam
3. Label control display simple text on the screen
4. Button control is used to control specific function of the applications
5. GridPane places its nodes into grid of row and columns. Nodes may span multiple rows or
columns. It is most flexible built-in layout pane.
6. Textfield is used for getting the input from user, the textfield is provided
7. addRow() is used to add the contents in row
8. setTitle() is used to set the title name on the screen
9. print the output
10. Stop the program
PROGRAM:

package myjavafxapplication;

import [Link];

import [Link];

import static [Link];

import [Link];

[Link];

import [Link];

import [Link];

import [Link];

import [Link]..PasswordField;

import [Link]..TextField;

import [Link];

import [Link];

public class myjavafxapplication extends Application

@override

public void start(Stage primaryStage) throws Exception

Label L1=new Label(“Enter your name”);

TextField tf1=new TextField();

Label L1=new Label(“Enter your password”);

TextField tf2=new TextField();

Button btn=new Button(“Submit”);

GridPane root=new GridPane();

[Link](10);
[Link](0,L1,ft1);

[Link](0,L2,ft2);

[Link](2, btn);

Scene s=new Scene(root,300,200);

[Link](“text Field demo”);

[Link](s);

[Link]();

}
public staic void main(String[] args)

launch(args);

}
 OUTPUT:

RESULT:

Thus the javaFX application for creating a login form has been implemented and executed
successfully.
 10.(b) LAYOUTS

AIM:

To write a javaFX application for creating a HBox Layout

ALGORITHMS:

1. Start the program

2. Declare the necessary packages for the progam
3. HBox layout arranges the children in the form of horizontal rows.
4. Button control is used to control specific function of the applications
5. getChildren() is used to returns the nodes in HBox.
6. addAll() is used to add the button on the screen
7. setTitle() is used to set the title name on the screen
8. print the output
9. Stop the program
PROGRAM:

package myjavafxapplication;

import [Link];

import [Link];

import [Link];

import [Link];

import [Link];

public class myjavafxapplication extends Application

@override

public void start(Stage primaryStage)

Hbox root=new Hbox();

Button B1=new Button(“One”);

Button B2=new Button(“Two”);

Button B3=new Button(“Three”);

Button B4=new Button(“Four”);

Button B5=new Button(“Five”);

Scene s=new Scene(root,200,100);

[Link]().addAll(B1,B2,B3,B4,B5);

[Link](s);

[Link](“Hbox demo”);

[Link]();

}
public staic void main(String[] args)

launch(args);

}
 OUTPUT:

RESULT:

Thus the javaFX application for creating a HBox layout has been implemented and executed
successfully.
 10.(b) MENUS

AIM:

To develop a javaFX application for creating menus.

ALGORITHMS:

1. Start the program

2. Create a Menu bartand it can be instantiated using new
keyword MenuBar m=new MenuBar();
3. Now create the menu. The name of the menu is passed as an arguments to the Menu
Class Menu f=new Menu(“File”);
4. Create the menuitem. The name of the menu is passed as an arguments to Menuitem
class MenuItem mi=new MenuItem(“new”);
5. Add menu items to the menu using add or addAll method
6. Add menu to menubar using add or addAll method
7. print the output
8. Stop the program
PROGRAM:

package application;

import [Link];

import [Link];

import [Link];

import [Link];

import [Link];

import [Link];

import [Link];

public class main extends Application

@override

public void start(Stage stage)

MenuBar mb=new MenuBar();

Menu filename=new Menu(“File”);

Menu editmenu=new Menu(“Edit”);

Menu aboutmenu=new Menu(“About”);

MenuItem newitem=new MenuItem(“New”);

MenuItem openfileitem=new MenuItem(“Open

File”); MenuItem saveitem=new MenuItem(“Save”);

MenuItem exititem=new MenuItem(“Exit”);

MenuItem cutitem=new MenuItem(“Cut”);

MenuItem copyitem=new MenuItem(“Copy”);

MenuItem pasteitem=new MenuItem(“Paste”);

[Link]().addAll(newitem,openfileitem,saveitem,exititem);

[Link]().addAll(cutitem,copyitem,pasteitem);
[Link]().addAll(fileMenu,editMenu,aboutMenu);

BorderPane r=new BorderPane();

[Link](menuBar);

Scene s=new Scene(r,400,300);

[Link](“JavaFX Menu Demo”);

[Link](s);

[Link]();

}
public staic void main(String[] args)

[Link](args);

}
 OUTPUT:

RESULT:

Thus the javaFX application for creating a Menu has been implemented and executed
successfully.