ADHI COLLEGE OF ENGINEERING
AND
TECHNOLOGY
Sankarapuram, Near Walajabad, Kancheepuram Dist, Pin: 631605
DEPARTMENT
OF
INFORMATION TECHNOLOGY
STUDENT NAME :
REGISTER NO :
SUBJECT CODE : CS3381
SUBJECT NAME : OBJECT ORIENTED PROGRAMMING LABORATORY
YEAR / SEMESTER : II/III (2023- 2024)
1
, Sankarapuram, Near Walajabad, Kancheepuram Dist, Pin: 631605
DEPARTMENT OF INFORMATION TECHNOLOGY
LABORATORY RECORD NOTEBOOK
2023–2024
This is to certify that this is a bonafide record of the work done by
Mr./Ms. _____________________ of the year______________ B.E/B.Tech.,
Department of _________________ in the Laboratory in
the Semester during the year 2023-2024.
Staff In-Charge Head of the Department
Submitted to the University Examination held on _____________________.
INTERNAL EXAMINER EXTERNAL EXAMINER
2
, TABLE OF CONTENTS
PAGE
EX.NO DATE LISTOFEXPERIMENTS SIGN
NO
(a) SEQUENTIAL SEARCH
1
(b) BINARY SEARCH
(c) SELECTION SORT
(d) INSERTION SORT
2
USING CLASSES & OBJECTS
(a) STACK OPERATIONS
(b) QUEUE OPERATIONS
3 PAYROLLPROCESSING USING INHERITANCE
4 TO CALCULATE AREA USING ABSTRACTCLASS
5 TO PRINTAREA USING AN INTERFACE
6 CREATION OF USER DEFINED
EXCEPTIONSHANDLING
7 TO IMPLEMENTS A MULTITHREADED
APPLICATIONS
8 DISPLAYING FILEINFORMATION
9 TO FIND THE MAXIMUM VALUE USING
GENERICFUNCTION
10 TO DEVELOP APPLICATIONS USING JAVAFX
CONTROLS,LAYOUTS & MENUS
3
, Ex. No: 1(a)
SEQUENTIAL SEARCH
Date:
AIM
To develop a Java application using sequential search,binary search and quadratic sorting
algorithms.
PROCEDURE
1. Calculate the mid element of the collection.
2. Compare the key items with the mid element.
3. If key = middle element, then we return the mid index position for the key found.
4. Else If key > mid element, then the key lies in the right half of the collection. Thus repeat
steps 1 to 3 on the lower (right) half of the collection.
5. Else key < mid element, then the key is in the upper half of the collection. Hence you
need to repeat the binary search in the upper half.
4
AND
TECHNOLOGY
Sankarapuram, Near Walajabad, Kancheepuram Dist, Pin: 631605
DEPARTMENT
OF
INFORMATION TECHNOLOGY
STUDENT NAME :
REGISTER NO :
SUBJECT CODE : CS3381
SUBJECT NAME : OBJECT ORIENTED PROGRAMMING LABORATORY
YEAR / SEMESTER : II/III (2023- 2024)
1
, Sankarapuram, Near Walajabad, Kancheepuram Dist, Pin: 631605
DEPARTMENT OF INFORMATION TECHNOLOGY
LABORATORY RECORD NOTEBOOK
2023–2024
This is to certify that this is a bonafide record of the work done by
Mr./Ms. _____________________ of the year______________ B.E/B.Tech.,
Department of _________________ in the Laboratory in
the Semester during the year 2023-2024.
Staff In-Charge Head of the Department
Submitted to the University Examination held on _____________________.
INTERNAL EXAMINER EXTERNAL EXAMINER
2
, TABLE OF CONTENTS
PAGE
EX.NO DATE LISTOFEXPERIMENTS SIGN
NO
(a) SEQUENTIAL SEARCH
1
(b) BINARY SEARCH
(c) SELECTION SORT
(d) INSERTION SORT
2
USING CLASSES & OBJECTS
(a) STACK OPERATIONS
(b) QUEUE OPERATIONS
3 PAYROLLPROCESSING USING INHERITANCE
4 TO CALCULATE AREA USING ABSTRACTCLASS
5 TO PRINTAREA USING AN INTERFACE
6 CREATION OF USER DEFINED
EXCEPTIONSHANDLING
7 TO IMPLEMENTS A MULTITHREADED
APPLICATIONS
8 DISPLAYING FILEINFORMATION
9 TO FIND THE MAXIMUM VALUE USING
GENERICFUNCTION
10 TO DEVELOP APPLICATIONS USING JAVAFX
CONTROLS,LAYOUTS & MENUS
3
, Ex. No: 1(a)
SEQUENTIAL SEARCH
Date:
AIM
To develop a Java application using sequential search,binary search and quadratic sorting
algorithms.
PROCEDURE
1. Calculate the mid element of the collection.
2. Compare the key items with the mid element.
3. If key = middle element, then we return the mid index position for the key found.
4. Else If key > mid element, then the key lies in the right half of the collection. Thus repeat
steps 1 to 3 on the lower (right) half of the collection.
5. Else key < mid element, then the key is in the upper half of the collection. Hence you
need to repeat the binary search in the upper half.
4
