WELCOME to III SEM Date: Class - ECE no of present : no of absent :

SUB : OBJECT ORIENTED PROGRAMMING AND DATA STRUCTURES Code :EC6301 Handle by B.Sathya Date: Class - ECE no of present : no of absent :

AIM To understand the concepts of Object oriented programming & learn to write simple applications using C++. OBJECTIVES To comprehend the fundamentals of object oriented programming, particularly in C++. To use object oriented programming to implement data structures. To introduce linear, non-linear data structures and their applications. Date: no of present : no of absent :

SYLLABUS Date: no of present : no of absent :

Overview of C++ Structures Class Scope and Accessing Class Members Reference Variables Initialization Constructors Destructors Member Functions and Classes Friend Function Dynamic Memory Allocation Static Class Members Container Classes and Integrators Proxy Classes Overloading: (Function overloading and Operator overloading) Date: no of present : no of absent : UNIT I - DATA ABSTRACTION & OVERLOADING

Base Classes and Derived Classes Protected Members Casting Class pointers and Member Functions Overriding Public, Protected and Private Inheritance Constructors and Destructors in derived Classes Implicit Derived Class Object To Base Class Object Conversion Composition Vs. Inheritance Virtual functions – This Pointer Abstract Base Classes and Concrete Classes – Virtual Destructors – Dynamic Binding. Date: no of present : no of absent : UNIT II - INHERITANCE & POLYMORPHISM

Abstract Data Types (ADTs) List ADT array-based implementation linked list implementation singly linked lists Polynomial Manipulation Stack ADT – Queue ADT Evaluating arithmetic expressions Date: no of present : no of absent : UNIT III - LINEAR DATA STRUCTURES

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. Date: no of present : no of absent : UNIT IV - NON-LINEAR DATA STRUCTURES

Sorting algorithms:  Insertion sort  Quick sort  Merge sort Searching:  Linear search  Binary Search UNIT V - SORTING and SEARCHING Date: no of present : no of absent :

TEXT BOOK: 1. Deitel and Deitel, “C++, How To Program”, Fifth Edition, Pearson Education, Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Third Edition, Addison-Wesley, REFERENCES: 1. Bhushan Trivedi, “Programming with ANSI C++, A Step-By-Step approach”, Oxford University Press, Goodrich, Michael T., Roberto Tamassia, David Mount, “Data Structures and Algorithms in C++”, 7th Edition, Wiley Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to Algorithms", Second Edition, Mc Graw Hill, Bjarne Stroustrup, “The C++ Programming Language”, 3rd Edition, Pearson Education, Date: no of present : no of absent :

▪ UNIT I - DATA ABSTRACTION & OVERLOADING Procedural Programming ▪ Programs are in the form of subroutine and the data items are global ▪ Program controls are jumps and call to subroutines ▪ E.g.., FORTRAN, COBOL Structured Programming ▪ Structured design: – Dividing a problem into smaller sub problems ▪ Program consists of multiple modules and each has a set of functions ▪ The structured design approach is also called – Top-down design – Modular programming Date: no of present : no of absent :

Object-Oriented Programming  The decomposition of a problem into number of entities called objects  It builds data (attributes) and functions (behavior) into these objects  It is based on certain concepts as shown in fig. Date: no of present : no of absent :

Before starting to learn C++ it is essential to have a basic knowledge of the concepts of Object oriented programming. Some of the important object oriented features are namely:  Objects  Classes  Inheritance  Data Abstraction  Data Encapsulation  Polymorphism  Overloading  Reusability Date: no of present : no of absent :

Objects:  Object is the basic unit of object-oriented programming.  Objects are identified by its unique name.  An object represents a particular instance of a class.  There can be more than one instance of a class.  Each instance of a class can hold its own relevant data.  An Object is a collection of data members and associated  member functions also known as methods. Date: no of present : no of absent :

Classes :  Classes are data types based on which objects are created.  Objects with similar properties and methods are grouped together to form a Class.  Thus a Class represents a set of individual objects. Characteristics of an object are represented in a class as Properties.  For example consider we have a Class of Cars under which Santro Xing, Alto and Wagan Represents individual Objects.  In this context each Car Object will have its own, Model, Year of Manufacture, Color, Top Speed, Engine Power etc., which form Properties of the Car class and the associated actions i.e., object functions like Start, Move, and Stop form the Methods of Car Class.  No memory is allocated when a class is created.  Memory is allocated only when an object is created, i.e., when an instance of a class is created. Date: no of present : no of absent :

▪ //program to read employee details and to output the data ▪ /////code begins here ///// ▪ #include // Preprocessor directiveinclude ▪ using namespace std; ▪ class employee // Class Declaration ▪ { ▪ Private: ▪ char empname[50]; ▪ int empno; ▪ ▪ public: ▪ void getvalue() ▪ { ▪ cout<<"INPUT Employee Name:"; ▪ cin>>empname; // waiting input from the Keyboard for the name Date: no of present : no of absent : A sample program to understand the basic structure of C++

▪ cout<<"INPUT Employee Number:"; ▪ cin>>empno; // waiting input from the Keyboard for the number ▪ } ▪ void displayvalue(){ ▪ cout<<"Employee Name:"<< empname << endl; // displays the employee name ▪ cout<<"Employee Number:"<< empno << endl; // displays the emloyee number ▪ } ▪ }; ▪ void main() ▪ { ▪ employee e1; // Creation of Object ▪ e1.getvalue(); // the getvalue method is being called ▪ e1.displayvalue(); // the displayvalue method is being called ▪ } ▪ ///// code ends here ////// Date: no of present : no of absent :

▪ URLS Concep Concep Date: no of present : no of absent :

SEMINAR TOPICS: Control Structures Manipulating strings Lists Topological sort Merge sort Quick sort Date: no of present : no of absent :

ASSIGNMENT TOPICS: Virtual functions and polymorphism Classes and objects AVL trees Stacks and queues Quick sort Searching Date: no of present : no of absent :

Queries ???????? Date: no of present : no of absent :

Thank you Date: no of present : no of absent :