K.L.N.

COLLEGE OF INFORMATION TECHNOLOGY

POTTAPALAYAM - 630 612.

COURSE PLAN

Faculty Name : S.THANGAMANI

Designation / Dept : ASSISTANT PROFESSOR / INFORMATION
TECHNOLOGY
Course Code and Name : EC6301 and OBJECT ORIENTED
PROGRAMMING AND DATA STRUCTURES
Semester : III
Programme / Branch : B.E / ECE
Year / Semester : II / III

1. At the end of the course, the student will be able to:

CO1: Explain the concepts of Object oriented programming.

CO2: Write simple applications using C++.

CO3: Discuss the different methods of organizing large amount of data.

CO4: Understanding the concepts of Data structures.

CO5: Apply representation of Graphs.

2. Course Outcome (CO) Assessment:

CO Knowledge Level Internal Test

CO1 K1,K2
CO2 K1,K2,K3
CO3 K1,K2
CO4 K1,K2
CO5 K1,K2,K3

Cognitive Domain:

K1-Remember; K2-Understand; K3-Apply; K4-Analyze; K5-Evaluate; K6- Create

3. CO-PO Mapping Table:

 COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1
CO2
CO3
CO4
CO5
CO6
CO7
Weighted
Average

4. Course Plan
S.No Dat Topics to be covered Text Teaching Focus for
. e Book/ Methodolog CO
Referenc y Achievemen
e t
UNIT I DATA ABSTRACTION & OVERLOADING
1 Overview of C++, Structures
2 Class Scope and Accessing Class
Members,Reference Variables
3 Initialization,Constructors,Destruct
ors
4 Member Functions and Classes
5 Friend Function, Dynamic Memory
Allocation
6 Static Class Members
7 Container Classes and Integrators
8 Proxy Classes
9 Overloading: Function overloading
and Operator Overloading
UNIT II INHERITANCE & POLYMORPHISM
10 Base Classes and Derived Classes
11 Protected Members, Casting Class
pointers and Member Functions
12 Overriding:Public, Protected and
Private Inheritance
13 Constructors and Destructors in
derived Classes
14 Implicit Derived
15 Class Object To Base, Class Object
Conversion
16 Composition Vs. Inheritance,
Virtual functions
17 This Pointer, Abstract Base Classes
and Concrete Classes
18 Virtual Destructors, Dynamic
Binding.
UNIT III LINEAR DATA STRUCTURES
19 Abstract Data Types (ADTs)
20 List ADT
 21 array-based implementation
22 linked list implementation
23 singly linked lists
24 Polynomial Manipulation
25 Stack ADT
26 Queue ADT
27 Evaluating arithmetic expressions
UNIT IV NON-LINEAR DATA STRUCTURES
28 Trees Binary Trees
29 Binary tree representation and
traversals
30 Application of trees
31 Set representation and Union-Find
operations
32 Graph and its representations
33 Graph Traversals
34 Representation of Graphs
35 Breadth-first search Depth-first
search
36 Connected components
UNIT V SORTING and SEARCHING

5. Content beyond syllabus

S.No Topic Mode of implementation Resource Person

1 Guest Lecture/SDP/Seminar Internal/External

6. Assignment

S.No Assignment Topics Submission date

7. Students class notes verification schedule:

S.No Portions Verification date

8. Internal Examination Schedule:

S.No Examination Date Topic Marks

9. Semester Evaluation Components (Anna University, Chennai):

S.No Component Marks

Internal External
1 Internal Examination 20
2 University Examination 80
Total

Staff Incharge HOD