R.V.

S TECHNICAL CAMPUS - COIMBATORE

COIMBATORE – 402

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

ACADEMIC YEAR 2022-2023
LESSON PLAN

LTPC
Subject Name : Data Structure Design Subject Code : AD 3251 3 00 3
CLASS / SEM: I /II
Staff In-Charge : E.ANITHA COURSE NUMBER:

GENERAL OBJECTIVES:
The student will be able to:
 To understand the concept of ADTs.
 To design linear data structures-lists, stacks, and queues
 To understand sorting, searching and hashing algorithms
 To apply Tree and Graph structures

COURSE OUTCOMES

Co Knowledge
Course Outcome
No Level
C01 Explain abstract data types K1
Design,implement, and analyse linear data structure, such as lists, queues,
C02 K5
and stacks,according to the needs of different applications
Design, implement, and analyse efficient tree structures to meet
C03 K2
requirements such as searching, indexing, and sorting.
Model problems as graph problems and implement efficient graph
C04 K2
algorithms to solve them.

PROGRAMME OUTCOMES
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences
3. Design/development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate

1
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities
with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to
the professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need
for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader
in diverse teams, and in multidisciplinary settings
10. Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to engage
in independent and life-long learning in the broadest context of technological change.

PROGRAM SPECIFIC OBJECTIVES (PSOs)

PSO 1: To analyze, design and develop computing solutions by applying foundational concepts
of Computer Science and Engineering.
PSO 2:To apply software engineering principles and practices for developing quality software
for scientific and business applications.
PSO 3:To adapt to emerging Information and Communication Technologies (ICT) to innovate
ideas and solutions to existing/novel problems.

BLOOM TAXONOMY COGNITIVE LEVELS

K1: RE - Remembering
K2: UN – Understanding
K3: AP - Applying
K4: AN - Analyzing
K5: EV - Evaluating
K6: CR - Creating
2
COURSE OUTCOME MAPPING WITH PROGRAM OUTCOME:

OUTC P PS PS
PO PO PS
OME:O PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 O1 O O
10 11 O3
No 2 1 2
CO1 2 3 2 2 2 - - 3 3 3 1 1 2 1 -
CO2 3 2 2 3 3 - - 2 1 1 1 2 3 1 -
CO3 2 3 2 2 2 - - 2 2 2 2 1 3 2 -
CO4 2 3 2 2 2 - - 2 2 1 2 1 3 1 -
CO5 1 1 3 1 3 - - 3 3 3 3 2 3 2 -
Overall Correlation
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO P PS PS
PS
10 11 O1 O O
O3
2 1 2
Overall
Correlat 3 3 2 1 2 2 1 1 0 0 2 2 3 2 1
ion

TEXT BOOK:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures and
Algorithms in Python” (An Indian Adaptation), Wiley, 2021.
2. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer
Edition 2015.
3. Narasimha Karumanchi, “Data Structures and Algorithmic Thinking with Python”
Careermonk, 2015

REFERENCES:
1. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction
to Algorithms", Third Edition, PHI Learning, 2010.
3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition,
Pearson Education, 2014
4. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education India,
2002.

UNIT- I
INTRODUCTION
3
Unit wise objectives :
 To Understand the concept of ADTs.
 To know about the classes and inheritance
 To introduce the analysis of algorithm
Releva Highes
Hours nt t Teaching
S.N Objective(s) of the Resource
Topic Require Cognit Methodology/Tech
O Topic referred
d ive nique
Level
Abstract Data CO1 K1 T1
To study about 1 Black Board
1. Types (ADTs)
abstract data type.

ADTs and To understand

2 1 CO1 K2 Black Board T1
classes ADTs and classes

Introduction to To known about

3 1 CO1 K1 Black Board T1,R1
OOP oop concepts

classes in To learn about

4 1 CO1 K1 Black Board T1
Python classes in python

To study the
5 Inheritance 1 CO1 K3 Black Board T1
inheritance classes

Namespaces – To known the

6 shallow and namespaces and 1 CO1 K2 Black Board T1
deep copying copying class

Introduction to To introduced the

7 analysis of analysis of 1 CO1 K4 Black Board T1
algorithms algorithm

asymptotic To introduce the

8 1 CO1 K2 Black Board T1
notations notation concepts

recursion
analyzing To known the
9 1 CO1 K2 Black & Board T1
recursive analysing algorithm
algorithm

Total Hours 9
Learning Outcomes
On learning this unit, the student should to:
 Know about the oop concepts
 .
Real –World applicability of the topics under this unit:
4
  Helpful in learning the abstract data type
Bridging with other subject/ Applicability in learning other topics/ subjects:
 Linked with analysis of algorithm
Scope for extra learning/ Assignments / Activities:
 Assignment: To explain the concept of notations& algorithm

UNIT- II
LINEAR STRUCTURE
Unit wise objectives
 To understand the linear structure of data.
 To Know about the analyse linear data structure, such as lists, queues, and stacks, according to the
needs of different applications

Releva High
Teaching
nt Cos est Resourc
S.N Topic Objective(s) of the Hours Methodolo
Cogn es
o Topic Required gy/Techniq
itive referred
ues
Level
To study the list T1
1. List ADT 1 CO2 K2 Black Board
ADT

Array based T1
2. To understand the 1 CO2 K2
implementations Black Board
array concepts

Linked list To implement the Black

implementation linked list concpts . Board&
3. 1 CO2 K1 T1
You tube
videos

.To evaluate the T1

4. Singly linked lists 1 CO2 K5 Black Board
single linked list.

Circularly linked To evaluate the T1

5. 1 CO2 K5 Black Board
lists circular linked list.

To evaluate double
Doubly
linked list
linked CO2 K5 T1
6. 1 Black Board
lists&applica
tions of lists

To explain Stack CO2 K T1,R2

7. Stack ADT 1 Black Board
ADT

5
 To explain queue CO2 K5 T1
8 Queue ADT 1 Black Board
ADT

Double
ended To study the double CO2 K1 Black Board T1,R1
9. 1
queues ended queue

Total Hours 9
Learning Outcomes:
On learning this unit, the student should be able to:
 Understand the list&queue concept
Real – world applicability of the topics under this unit:

 It is applicable for the ADT concepts

Bridging with other subjects/ Applicability in learning other topics / subjects
 Creating application using these strategies we can learn the linear structure.
Scope for extra learning / Assignments / Activities:
 We can able to understand the concept of queue.

UNIT III
SORTING AND SEARCHING
Unit wise objectives :
 To understand sorting, searching and hashing algorithms

S.No Topic Hours Releva Highest Teaching

Objective(s) of the Resources
Require nt Cos Cognitive Methodology
Topic referred
d Level /Techniques
1 Bubble
To evaluate bubble
&selection 1 CO3 K5 Black Board T1
sorting
sort

2 Insertion sort To evaluate insertion

1 CO3 K5 T1
sort Black Board
3 Merge sort To evaluate merge Black Board,
sort 1 CO3 K5 PPT T1&

4 Quick sort .To evaluate quick CO3 K5 Black T1

1
sort. Board ,PPT
5 Linear search To apply linear Black
techniques CO3 K3 Board&
1
youtube T1,R1
videos
6. .Binary search To find the
searching techniques 1 CO3 K2 Black Board T1

6
 To implement the
Hashing& CO3 K3 T1
7 hash function 1 Black Board
hash functions
To explain the
Collision CO3 K2 T1
8. collision handling 1 Black Board
handling
Load factors, To. introduce the
9 rehashing efficiency factors. 1 CO3 K1 Black Board T1
&efficiency
Total Hours 9
Learning Outcomes:
 To implement the sorting techniques
On learning this unit, the student should be able to:
 Understand the concept of sorting methodology
Real – world applicability of the topics under this unit:
 To identify the sorting element in the list
Bridging with other subjects/ Applicability in learning other topics / subjects
 Used in the searching the element in the list
Scope for extra learning / Assignments / Activities:
 We can learn the rehashing factors

UNIT- IV
TREE STRUCTURES
Unit wise objectives :
 To understand the Tree structure
 To know about the Tree ADT.

Objective(s) of the Releva Highes

S.N Topic Hours nt Cos t Teaching
Topic Resources
o Require Cogniti Methodology/
referred
d ve Techniques *
Level
To explain the tree T1
1. .Tree ADT 1 CO4 K2 Black Board,
ADT

Binary Tree To evaluate binary

2. 1 CO4 K5 Black Board T1
ADT tree

To find the tree T1

3. Tree traversals 2 CO4 K2 Black Board
traversals

To evaluate the
4. .Binary search 1 CO4 K5 Black Board T1
trees searching concepts

5. AVL Trees To explain the AVL 2 CO4 K2 Black Board T1,R1

7
 tree

Heaps & multi To understand the

6. way search heap and multi-way 1 CO4 K2 Black Board T1
trees trees

Total Hours 9

Learning Outcomes:
On learning this unit, the student should be able to:
 Understanding the tree structure concept
Real – world applicability of the topics under this unit:
 To apply the concept of tree traversal.
Bridging with other subjects/ Applicability in learning other topics / subjects
 It is used for the AVL Tree
Scope for extra learning / Assignments / Activities:
 Using the tree structure we can search the multi way trees

UNIT-5
GRAPH STRRUCTURES
Unit wise objectives :
 To apply Graph structure.
 To understand the concept of minimum spanning tree
Hours Highes
S.N Objective(s) of t Teaching
Topic Require Releva Resources
o the Topic Cogniti Methodology/
nt COs referred
d ve Techniques *
Level
To explain the
1. Graph ADT 1 CO5 K4 Black Board, T1
Graph ADT

To study the 1
Representations
2 representations of CO5 K2 Black Board T1
of graph
graph

To evaluate the 1
3. Graph traversals graph traversals CO5 K5 Black Board T1,R1

To study the 1
4. DAG CO5 K2 Black Board T1,R1
DAG

Topological . To know about

5. 1 CO5 K3 Black Board T1
ordering topological sort

6 Shortest paths To understand the 1 CO5 K2 Black Board T1

8
 shorest paths

To find the
Minimum
7 minimum 1 CO5 K3 Black Board T1
spanning tree
spanning tree

Total Hours 9

Learning Outcomes:
On learning this unit,the student should be able to:
 .To represent the graph structure
Real-world applicability of the topics under this unit:
 To evaluate the tree traversals
Bridging with other subjects/Applicability in learning other topics/subjects:
 Helps to increase the ordering of tree structure
Scope for extra learning/Assignments/ Activities:
 Seminar on the minimum spanning tree
TOTAL:45 hrs LECTURE HOURS: 45hrs

STAFF INCHARGE HOD