CMS COLLEGE OF ENGINEERING AND TECHNOLOGY

COIMBATORE-641032
DEPARTMENT OF SCIENCE & HUMANITIES
COURSE PLAN

Course Code : CS25C05 Unit : I-V

Course Name : DATA STRUCTURE USING C++ Degree : B.E

Faculty Name : Branch : ECE

Designation /
: ASSISTANT PROFESSOR / CSE Year : I
Dept
Academic Year : 2024-2025 Semester : II

1. PROGRAM OUTCOMES

PO1: Apply the knowledge of mathematics, science, engineering fundamentals, and programming
concepts to solve engineering problems.

PO2: Identify, formulate, analyze, and solve computational and logical problems systematically.

PO3: Design and develop software solutions using algorithms, flowcharts, object-oriented programming
and data structures.

PO4: Investigate and analyze computational problems using appropriate data structures and algorithms.

PO5: Use modern programming tools, IDEs, debugging tools and software development environments
effectively.

PO6: Apply computing knowledge considering societal, cultural, and ethical responsibilities.

PO7: Understand environmental and sustainability issues in computing applications and technological
development.

PO8: Apply ethical principles and professional responsibilities in software development practices.

PO9: Work effectively as an individual and as a team member in programming activities and projects.

PO10: Communicate effectively through presentations, seminars, reports, and discussions.

PO11: Apply project management and organizational skills in software development activities.

PO12: Recognize the importance of lifelong learning and adapt to emerging technologies.
 PRE-REQUISITE: Students should possess basic programming knowledge and logical problem-
solving ability.
3. OBJECTIVES:
 To introduce the fundamentals of computers and computing systems.
 To develop computational thinking and problem-solving skills.
 To understand algorithms, flowcharts, and logical reasoning.
 To provide knowledge of Scratch programming concepts.
 To develop simple applications using app development platforms.
 To understand data representation, spreadsheets, and visualization techniques.
1. COURSE OUTCOMES:
At end of this course, students will be able to:

1. Understand the basic organization and applications of computers.

2. Apply computational thinking and logical reasoning for problem solving.
3. Design algorithms and flowcharts for simple computational problems.
4. Develop Scratch programs using loops, conditions, and variables.
5. Create animations, games, and simple applications using Scratch and
app development platforms.
6. Use spreadsheets for calculations, data handling, and visualization.
2. Mapping PO’s and CO’s

Course Program Outcomes (POs)

Outco PO PO PO1
mes PO1 PO3 PO4 PO5 PO7 PO8 PO9 P011 P012
2 6 0
CO1 √ √ √ √ √ √ √
CO2 √ √ √ √ √ √ √
CO3 √ √ √ √ √ √ √
CO4 √ √ √ √ √ √ √
CO5 √ √ √ √ √ √ √
CO6 √ √ √ √ √ √ √

UNIT-I: ALGORITHMIC PROBLEM SOLVING

No of No of
Books Teaching
[Link]. Topics to be covered Hrs Hrs
referred methodology
required taken
1 Overview of C++ T1,R1 Chalk & Talk 1 1
2 Structures and Classes T1,R1 Chalk & Talk 1 1
3 Constructors and Destructors T1,R1 PPT 1 1
4 Member Functions T1,R1 PPT 1 1
5 Friend Functions T1,R1 Chalk & Talk 1 1
6 Dynamic Memory Allocation T1,R1 Chalk & Talk 1 1
7 T1,R1 Chalk & Talk 1 1
Static Class Members
Function Overloading Practical
8 T1,R1 1 1
Demo
Operator Overloading Practical
9 T1,R1 Demo
1 1

Number of hours planned for Unit –I Number of hours

9
Handled

UNIT-II: DATA, EXPRESSIONS, STATEMENTS

 Books Teaching No of No of
[Link]. Topics to be covered
Referred methodology Hrs Hrs
1 Asymptotic Notations T1,R1 Chalk & Talk 1 1
Arrays and Representations Chalk & Talk 1
2 T1,R1 1
3 Stack Operations T1,R1 Chalk & Talk 1 1
4 Queue Operations T1,R1 Chalk & Talk 1 1
5 Linked Lists T1,R1 Chalk & Talk 1 1
6 T1,R1 Chalk & Talk 1 1
Stack using Linked List
7 Queue using Linked List T1,R1 Chalk & Talk 1 1
8 Expression Evaluation T1,R1 PPT 1 1
Chalk & Talk 1
9 Logic Applications T1,R1 1
Practical Demo 1
10 Polynomial Addition 1
Number of hours planned for Unit –II 9 Number of hours

UNIT-III CONTROL FLOW, FUNCTIONS

Books Teaching No of No of
[Link]. Topics to be covered
Referred methodology Hrs Hrs
1 Base and Derived Classes T1,R1 Chalk & Talk 1 1
Types of Inheritance Chalk & Talk 1
2 T1,R1 1
3 Protected Members T1,R1 Chalk & Talk 1 1
4 Constructors in Derived Classes T1,R1 Chalk & Talk 1 1
5 T1,R1 Chalk & Talk 1 1
Method Overriding
6 Virtual Functions T1,R1 Chalk & Talk 1 1
7 T1,R1 Chalk & Talk 1 1
Abstract Base Classes
8 Base Conversion Algorithm T1,R1 Chalk & Talk 1 1
9 Virtual Destructors T1,R1 Chalk & Talk 1 1
Number of hours planned for Unit –III 9 Number of hours

UNIT-IV: LISTS, TUPLES, DICTIONARIES

Books Teaching No of No of
[Link]. Topics to be covered
Referred methodology Hrs Hrs
1 Trees and Binary Trees T1,R1 Chalk & Talk 1 1
Chalk & Talk 1
2 Binary Tree Traversals T1,R1 1
3 Threaded Binary Trees T1,R1 Chalk & Talk 1 1
4 T1,R1 Chalk & Talk 1 1
Graph Representations
5 Graph Traversals T1,R1 Chalk & Talk 1 1
6 Connected Components T1,R1 Chalk & Talk 1 1
7 Shortest Path Algorithms T1,R1 Chalk & Talk 1 1
8 T1,R1 Chalk & Talk 1 1
Standard Template Library
9 Lists and String Manipulation T1,R1 Chalk & Talk 1 1
Number of hours planned for Unit –IV 9 Number of hours
UNIT-V: FILES, MODULES, PACKAGES
 Books Teaching No of No of
[Link]. Topics to be covered
Referred methodology Hrs Hrs
1 Linear Search T1,R1 Chalk & Talk 1 1
2 Binary Search T1,R1 Chalk & Talk 1 1
3 Insertion Sort T1,R1 Chalk & Talk 1 1
4 T1,R1 Chalk & Talk 1 1
Merge Sort
5 Quick Sort T1,R1 Chalk & Talk 1 1
6 Heap Sort T1,R1 Chalk & Talk 1 1
7 Best, Worst and Average Case AnalysisT1,R1 Chalk & Talk 1 1
8 Complexity Analysis T1,R1 Lab practice 1 1
9 Comparative Study of Algorithms, T1,R1 Lab practice 1 1
Number of hours planned for Unit –V 9 Number of hours

Total number of hours

Planned 45 Total number of hours Handled

TEXT BOOKS:
Brennan and Resnick’s CT Framework 2012:
T1 [Link]
[Link], ―An CS50X 2025 Scratch YouTube lectures
by Prof. David J Malan, Harvard University: [Link]
T2 v=2WtPyqwTLKM IntroductiontoPython– Revisedand updated for Python
3.2,Network TheoryLtd.,2011.

REFERENCES:

R1 Thareja, R. (2020). Fundamentals of computers. Oxford University Press

R2 Rajaraman, V., & Adabala, N. (2014). Fundamentals of computers. PHI Learning

R3 Brookshear, J. G., & Brylow, D. (2015). Computer science: An overview. Pearson.
R4 Dromey, R. G. (1982). How to solve it by computer. Prentice Hall International.
Marji, M. (2014). Learn to program with Scratch: A visual introduction to
R5
programming with games, art, science and math. No Starch Press.
Riley, D. D., & Hunt, K. A. (2014). Computational thinking for the modern problem
R6
solver. CRC Press.
R7 Venkatesh, G., & Mukund, M. (2021). Computational thinking. Notion Press.

Prepared by Approved by

Signature

Name Dr.K MANICKARAJ Dr. N. SUDHA

Designation HoD PRINCIPAL