Scribd
Upload
22 views

Lesson Plan DSD

The document is a lesson plan for the Data Structure Design course at Sriram Engineering College, detailing the topics to be covered over five units, including Abstract Data Types, Linear Structures, Sorting and Searching, Tree Structures, and Graph Structures. Each unit outlines specific subjects, hours allocated, and references from the textbook. The course outcomes specify the skills students should acquire by the end of the course, such as implementing and analyzing various data structures.

Uploaded by

praiselin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views

Lesson Plan DSD

The document is a lesson plan for the Data Structure Design course at Sriram Engineering College, detailing the topics to be covered over five units, including Abstract Data Types, Linear Structures, Sorting and Searching, Tree Structures, and Graph Structures. Each unit outlines specific subjects, hours allocated, and references from the textbook. The course outcomes specify the skills students should acquire by the end of the course, such as implementing and analyzing various data structures.

Uploaded by

praiselin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

SRIRAM ENGINEERING COLLEGE, PERUMALPATTU

SCHOOL OF COMPUTER SCIENCE & ENGINEERING-CSE DEPT


SREC/CSE/LP
FM: 16
LESSON PLAN

Name : EJ HONESTY PRAISELIN Designation : AP


Branch : AI&DS, CSBS Subject code : AD3251
Semester : II Subject Name : Data Structure Design

Topics Hours(in Date Text / Page No.


units of Planned Completed Reference
one book
period)

UNIT I ABSTRACT DATA TYPES

Abstract Data Types 1 T1 39-50


ADTs and classes 1 T1 277
Introduction to OOP 1 T1 56
Classes in Python 1 T1 69-80
Inheritance 1 T1 82-95
Namespaces, Shallow and 1 T1 46, 96-
Deep copying 102
Introduction to analysis of 1 T1 111-122
algorithms
Asymptotic notations, 1 T1 123-135
Recursion
Analyzing recursive 1 T1 161
algorithms
Total No. of Hours 9 ** **

UNIT II LINEAR STRUCTURES

List ADT, Array based 1 T1 277-280


implementation
Linked List Implementations 1 T1 292
Singly Linked Lists 1 T1 256-265
Circularly Linked Lists 1 T1 266-269
Doubly Linked Lists 1 T1 270-276
Applications Of Lists 1 T1 281-284
Stack ADT 1 T1 229-238
Queue ADT 1 T1 239-246
Double Ended Queues 1 T1 247-249
Total No. of Hours 9

UNIT III SORTING AND SEARCHING

Bubble sort 1 T1 427


Selection sort 1 T1 386
Insertion sort 1 T1 387
Merge sort 1 T1 538-547
Quick sort 1 T1 550-560
Linear search, Binary search 1 T1 564-566
Hashing, Hash functions 1 T1 410-416
Collision handling 1 T1 417
Load factors, rehashing, and 1 T1 420-426
efficiency
Total No .of Hours 9 ** **

UNIT IV TREE STRUCTURES

Tree ADT 1 T1 300-310


Binary Tree ADT 1 T1 311-316
Binary Tree ADT 1 T1 311-316
Tree traversals 1 T1 328-341
Tree traversals 1 T1 328-341
Binary search trees 1 T1 460-473
AVL trees 1 T1 481-489
Heaps 1 T1 370-384
Multiway search trees 1 T1 460-497
Total No. of Hours 9 ** **

UNIT V GRAPH STRUCTURES

Graph ADT 1 T1 620-626


Representations of graph 1 T1 627-637
Representations of graph 1 T1 627-637
Graph traversals 1 T1 638-349
DAG 1 T1 655-658
Topological ordering 1 T1 655-658
Shortest paths 1 T1 659-669
Minimum spanning trees 1 T1 670-685
Minimum spanning trees 1 T1 670-685
Total No of Hours 9 ** **

COURSE OUTCOMES:

At the end of the course, the student should be able to:

CO1:explain abstract data types


CO2:design, implement, and analyse linear data structures, such as lists, queues, and stacks,
according to the needs of different applications
CO3:design, implement, and analyse efficient tree structures to meet requirements such as
searching, indexing, and sorting
CO4:model problems as graph problems and implement efficient graph algorithms to solve them
TEXT BOOKS:

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.

Staff In-Charge HOD

You might also like