CHRISTIAN COLLEGE OF ENGINEERING AND TECHNOLOGY

ODDANCHATRAM – 624 619

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING
LESSON PLAN
ACADEMIC YEAR ODD SEMESTER 2025-2026

Department : COMPUTER SCIENCE AND ENGINEERING

Cou
Course Title : DATA STRUCTURE USING C++ CS25C05
rse
Cod
e
Course Instructor: [Link]
Compulsory / Elective : Compulsory
Basics about computing and Programming concepts.
Prerequisites Knowledge: Basic about solving programming
Knowledge about binary trees and sorting and searching techniques.
Duration : 45 PERIODS Credit Units : 3
Class / Laboratory 3-0-2-4 [L T P C]
Schedule :
In 2025, the AI curriculum gap is the Mapping PO’s and
Curriculum gap :
disconnect between traditional schooling and PSO’s
the rapid growth of generative technology. Key
issues include a technical skills shortage in
prompt engineering and automation, low PO’s:
educator literacy regarding AI ethics, 1,2,3,4,5,9,10,11,12
PSO’s: 1,2,3
and outdated materials that cannot keep pace
with monthly software updates.
The main objectives of this course are to:
1. Learn the basic AI approaches
Course Objectives: 2. Develop problem solving agents
3. Perform logical and probabilistic reasoning
CO1: Explain intelligent agent frameworks
CO2: Apply problem solving techniques
CO3: Apply game playing and CSP
Course Outcomes: techniques CO4: Perform logical reasoning
CO5: Perform probabilistic reasoning under uncertainty

TEXT BOOKS:
1. Deitel, P. J., & Deitel, H. M. (2005). C++ how to program.
Pearson Education.
REFERENCES:

2. Deitel, P. J., & Deitel, H. M. (2005). C++ how to program.

Pearson Education.
Texts & References:
(*recommended text book(s)) 3. 2. Ellis Horowitz, E., Sahni, S., & Mehta, D. (2007).
Fundamentals of data structuresin C++. Universities Press Pvt
Ltd.
4. 3. Weiss, M. A. (2007). Data structures and algorithm
analysis in C++. Addison-Wesley.
5. 4. Trivedi, B. (2010). Programming with ANSI C++: A step-
by-step approach. OxfordUniversity Press.
6. 5. Goodrich, M. T., Tamassia, R., & Mount, D. (2004). Data
structures andalgorithms in C++. Wiley.
 ● Tutorials
Student Assessments: ● Internal Assessment Test I,II and Model
● Final Examination
● Quiz and Examinations
Outcome Assessment ● Assignments
● Course Evaluation
1
PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 3 - - - - 2 3 3 1 2 1 1
2 2 2 1 1 1 - - - 2 2 3 1 3 2 2
3 2 1 2 1 - - - - 2 1 1 3 1 2 1
4 2 1 2 2 - - - - 2 1 2 2 1 3 3
5 3 2 2 1 1 - - - 3 2 1 2 2 2 1
AVg. 2 1 2 2 1 - - - 2 2 2 2 2 2 2

UNIT- I DATA ABSTRACTION AND OVERLOADING

No. Tentati Actual Teachi
S Ref. Book/
of Topics to be covered ve Date ng
l Page No.
Class Date of Learni
.
es of completio ng
N n
Require completio Methods
o d n
1 1 Introduction to C++ T1 (1 –
5) TLM1
2 1 Structures, class, scope T1(5 – 27) TLM2

3 1 Accessing class members T1(36 – 42) TLM1

4 1 Reference variables, T1(43 – 61) TLM1

initalization,constructor
5 1 Member function ,static function T1 TLM1
(43 – 61)
6 3 Dynamic memory allocation T1(43 – 61) TLM6

7 1 Function overloading T1(68 – 76) TLM1

UNIT - II INHERITANCE AND POLYMORPHISM

No. Tentati Actual Teachi
S Ref. Book/
of Topics to be covered ve Date ng
l Page No.
Class Date of Learni
.
es of completio ng
N Require completio Methods
n
o d n
T1(79 – 84)
1 2 Base classes and derived classes TLM1
Type of inheritance T1(85 – 99)
2 2 TLM1
T1(118 – 121)
3 2 Proctected members, constructors TLM1

4 1 Virtual function, dynamic function TLM1

T1(143 – 152)
5 1 Overriding and dynamic binding TLM1
Program to implement various
6 1 TLM1
operations on array
UNIT - III LINEAR DATA STRUCTURES
No. of Tentativ Actual Teaching
S Ref. Book/
Topics to be covered
 Classe e Date of Learni
l Page No.
. s UNIT - IV NON LINEAR DATA STRUCTURE Date of Completi ng
N Requir
No. of Completi Actual
Tentativ on Metho
Teachi
S Ref.
ol edClass Topics to be covered eon Date ng ds
Book/
es Asymptotic notation,big(o),omega T1(159 Date of of Learni
1. 1 Page– 161) TLM6
Requir completi completi ng
N Best, worst ,average case anaysis No. –,201)
T1(161 TLM2
2o ed 2 on on Metho
ds
Array and its binary
Trees, representation
tree
1 1 TLM1
Stack
Tree representation and traversal
2 2 TLM1
Graph representation and traversal
3 2 TLM7
T2
4 2 Graph traversal TLM1
(319 –
328)
Target Hours: 2
STL Content Beyond SyllabusT2
5 2 TLM1
(332 –
No. of Tentative Actual Date Teaching
Sl. Ref. Book337)
/
Classes Topics to be covered Date of of Learning
No Page No.
Required UNIT – V SEARCHING, SORTING Completion Completion Methods
1 2
No. Generative AI (GANs, LLMs) Tentati Actual TLM2
Teachi
S Ref.
of Topics to be covered ve Date ng
l Book/
Clas Date of Learni
. Page
Teaching Learning Methods completio
ses of ng
N Require
TLM1 Chalk and Talk TLM4 Problem Solving No. TLM7 n Seminars orMetho
completi GD
o d on ds
TLM2 PPT TLM5 Programming TLM8 Lab demo
TLM3 Tutorial TLM6 Assignment or Quiz
T2 TLM9 Case study
1 Sorting TLM1
2 (365 –
368)
T2
2 2 Insertion, merge sort TLM2
(347 –
352)
T2
3 1 Quick sort TLM1
(347 –
352)
T2
4 1 TLM1
Heap sort (347 –
352)
T2
5 1 Linear search and binary TLM6
(500 –
506)
6 2 TLM7
COURSE INSTRUCTOR HOD PRINCIPAL
3