Monday, 23 February 2026
OPERAORS IN JAVA
JAVA OPERATORS
https://www.slideshare.net/slideshow/operators-in-java-presentation-1278350OPERATORS59/127835059
OOPS USING JAVA
UNIT I JAVA FUNDAMENTALS 9
Introduction to Java - Java Architecture –keywords
–Identifiers –Variables – Data types–Operators–Type
conversion–Selection control Structure –Iteration
Control Structure
UNIT
II INTRODUCTION TO OBJECT
ORIENTED PROGRAMMING 9
Introduction to Object Oriented Programming–Methods
– Constructors – This keyword –Memory management-
Encapsulation - Abstraction - Access Modifiers –
Arrays
UNIT III INHERITANCE & POLYMORPHISM
9
Introduction to
inheritance- Single Inheritance – Multilevel Inheritance –Polymorphism –Method
overloading
UNIT IV COLLECTIONS , PACKAGES AND EXCEPTION HANDLING 9
Collection Interface –
Collection Class – Array List –Linked List –Introduction to Package –Import –
Exception –Try – Throw– throws – Catch –Finally – User defined Exception
UNIT V STRING HANDLING 9
String Constructors –
Character extraction – String Comparison – Searching strings – String
Buffer-String Builder
OBJECT ORIENTED PROGRAMMING WITH DATA STRUCTURES
UNIT
I BASIC
OOPS CONCEPTS 9
Overview of C++ – Structures – Class Scope and
Accessing Class Members – Reference Variables –
Constructors – Destructors – Member Functions and
Classes – Friend Function – Dynamic Memory
Allocation – Static ClassMembers – Overloading:
Function overloading and Operator Overloading.
UNIT
II INHERITANCE
& POLYMORPHISM 9
Base Classes and Derived Classes – Protected Members
– Overriding – Public, Protected and Private
Inheritance – Constructors and Destructors in
derived Classes - Class Object To Base – Class Object
Conversion – Composition Vs. Inheritance – Virtual
functions – This Pointer – Virtual Destructors –
UNIT III LINEAR DATA STRUCTURES 9
Abstract Data Types (ADTs)
– List ADT – array-based implementation – linked list implementation ––
singly linked lists
–Polynomial Manipulation - Stack ADT – Queue ADT - Evaluating arithmetic
expressions
UNIT IV NON-LINEAR DATA STRUCTURE 9
Trees – Binary Trees –
Binary tree representation and traversals – Application of trees: Set
representation
and Union-Find operations
– Graph and its representations – Graph Traversals – Representation of Graphs
– Breadth-first search –
Depth-first search - Connected components
UNIT V SORTING AND SEARCHING 9
Sorting algorithms:
Insertion sort - Quick sort - Merge sort - Searching: Linear search –Binary
Search

