DEPARMENT OF INFORMATION TECHNOLOGY

LESSON PLAN
Faculty Name

: Mr. S. Karthic, Assistant Professor, Department of IT

Subject Name

: OBJECT ORIENTED PROGRAMMING AND DATA STRUCTURES

Subject Code

: EC6301

Year / Semester

: II / III

Degree & Branch : B.E-ECE

Aim:
To learn the basic concepts of OOPS to implement various data structures

Objectives:
Students of B.E Electronics and Communication Engineering will be able to

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.

To learn different methods of organizing large amount of data

To learn and understand various searching and sorting algorithms

S.No

Topics to be Covered

Periods/No. Teaching
Book
of Hours
Aids

UNIT I DATA ABSTRACTION & OVERLOADING

1

Overview of C++

BB

T1,R1

Structures , Class Scope and Accessing Class Members

BB

T1,R1

Reference Variables Initialization

BB

T1,R1

Constructors, Destructors

PPT

T1,R1

Member Functions and Classes , Friend Function

BB

T1,R1

Static Class Members

BB

T1,R1

Container Classes and Integrators, Proxy Classes

BB

T1,R1

Overloading: Function overloading

BB

T1,R1

Operator Overloading.

BB

T1,R1

Total Hours Planned

UNIT II INHERITANCE & POLYMORPHISM

10

Base Classes and Derived Classes, Protected Members

BB

T1,R1

11

Casting Class pointers and Member Functions

BB

T1,R1

12

Overriding Public, Protected and Private Inheritance

BB

T1,R1

13

Constructors and Destructors in derived Classes

PPT

T1,R1

14

Implicit Derived Class Object To Base

BB

T1,R1

15

Class Object Conversion, Composition Vs. Inheritance

BB

T1,R1

16

Virtual functions, this Pointer

BB

T1,R1

17

Abstract Base Classes and Concrete Classes

PPT

T1,R1

18

Virtual Destructors , Dynamic Binding.

OHP

T1,R1

Total Hours Planned

UNIT III LINEAR DATA STRUCTURES

19

Abstract Data Types

BB

T2,R2

20

List ADT

BB

T2,R2

21

Array based implementation

BB

T2,R2

22

Linked list implementation

BB

T2,R2

23

Singly linked lists

BB

T2,R2

24

Polynomial Manipulation

BB

T2,R2

25

Stack ADT

OHP

T2,R2

26

Queue ADT

OHP

T2,R2

27

Evaluating arithmetic expressions

BB

T2,R2

Total Hours Planned

10

UNIT IV NON-LINEAR DATA STRUCTURES

28

Trees

BB

T2,R2

29

Binary Trees

PPT

T2,R2

30

Binary tree representation and traversals

BB

T2,R2

31

Application of trees

BB

T2,R2

32

Set representation and Union-Find operations

PPT

T2,R2

33

Graph and its representations

BB

T2,R2

34

Graph Traversals, Representation of Graphs

BB

T2,R2

35

Breadth-first search Depth-first search

BB

T2,R2

36

Connected components

BB

T2,R2

Total Hours Planned

UNIT V SORTING and SEARCHING

37

Sorting algorithms: Insertion sort

BB

T2,R2

38

Quick sort

OHP

T2,R2

39

Merge sort

BB

T2,R2

40

Searching: Linear search

BB

T2,R2

41

Binary Search

OHP

T2,R2

Total Hours Planned

CONTENT BEYOND THE SYLLABUS

42

Binary search trees

BB

43

Heap Sort

BB

Total Hours: 47
TEXT BOOK:
1. Deitel and Deitel, C++, How To Program, Fifth Edition, Pearson Education, 2005
2. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Third Edition, AddisonWesley, 2007.
REFERENCE BOOK
1. Bhushan Trivedi, Programming with ANSI C++, A Step-By-Step approach, Oxford University Press,
2010.
2. Goodrich, Michael T., Roberto Tamassia, David Mount, Data Structures and Algorithms in C++, 7th
Edition, Wiley. 2004.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to
Algorithms", Second Edition, Mc Graw Hill, 2002.
4. Bjarne Stroustrup, The C++ Programming Language, 3rd Edition, Pearson Education, 2007.
5. Ellis Horowitz, Sartaj Sahni and Dinesh Mehta, Fundamentals of Data Structures in C++, Galgotia
Publications, 2007.

FACULTY IN-CHARGE

HOD

PRINCIPAL