JEPPIAAR NAGAR, CHENNAI – 600119

Department of Information Technology.

LESSON PLAN
Name : Vinothkumar V Designation : Assistant Professor
Course/Branch : B.Tech / IT Subject Code : CD3291
Semester/Year : III/II –A Sec Subject Name : Data Structures and
Algorithms
Course Coordinator : Anuja T Regulation : R -2021
Batch : 2023-2027 LTPC : 3 0 0 3

Course Objectives
To impart knowledge about the following topics:
 To understand the concepts of ADTs
 To design linear data structures – lists, stacks, and queues
 To understand sorting, searching, and hashing algorithms
 Be exposed to graph algorithms
 To apply Tree and Graph structures

Course outcomes
At the end of the course students will be able to:
C204.1: Explain abstract data types
C204.2: Design, implement, and analyze linear data structures, such as lists, queues, and stacks, according to
the needs of different applications
C204.3: Design, implement, and analyze efficient tree structures to meet requirements such as searching,
indexing, and sorting
C204.4: Model problems as graph problems and implement efficient graph algorithms to solve them
C204.5: Critically analyse the various algorithms.

UNIT I – ABSTRACT DATA TYPES

SYLLABUS:
Abstract Data Types (ADTs) – ADTs and classes – introduction to OOP – classes in Python – inheritance –
namespaces – shallow and deep copying Introduction to analysis of algorithms – asymptotic notations – divide
& conquer – recursion – analyzing recursive algorithms
UNIT OBJECTIVES:
 To understand the concepts of ADTs
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Abstract Data Types (ADTs), Black Board
1 01 12-08-2024 R5 77 C204.1
ADTs and classes &Chalk
introduction to OOP Black Board
2 01 13-08-2024 R6 17 C204.1
&Chalk
classes in Python Black Board
3 04 14-08-2024 T1 29 C204.1
&Chalk
Inheritance, namespaces 104, Black Board
4 02 16-08-2024 T1 C204.1
46 &Chalk
shallow and deep copying
Black Board
5 Introduction to analysis of 04 16-08-2024 T1 101
&Chalk
C204.1
algorithms
 asymptotic notations Black Board
6 01 19-08-2024 T1 123 C204.1
&Chalk
divide & conquer Black Board
7 01 20-08-2024 T1 538 C204.1
&Chalk
recursion Black Board
8 04 21-08-2024 T1 148 C204.1
&Chalk
analyzing recursive Black Board
9 08 22-08-2024 T1 161 C204.1
algorithms &Chalk

UNIT II – LINEAR STRUCTURES

SYLLABUS:
List ADT – array-based implementations – linked list implementations – singly linked lists – circularly linked
lists – doubly linked lists – Stack ADT – Queue ADT – double ended queues – applications
UNIT OBJECTIVES:
 To design linear data structures – lists, stacks, and queues
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
List ADT Black Board
10 02 23-08-2024 T1 277 C204.2
&Chalk
array-based implementations Black Board
11 04 23-08-2024 T1 292 C204.2
&Chalk
linked list implementations. Black Board
12 01 27-08-2024 T1 255 C204.2
&Chalk
singly linked lists Black Board
13 04 28-08-2024 T1 256 C204.2
&Chalk
circularly linked lists Black Board
14 08 29-08-2024 T1 266 C204.2
&Chalk
doubly linked lists Black Board
15 02 30-08-2024 T1 270 C204.2
&Chalk
Stack ADT Black Board
16 04 30-08-2024 T1 230 C204.2
&Chalk
Queue ADT Black Board
17 01 02-09-2024 T1 240 C204.2
&Chalk
double ended queues, Black Board
18 01 03-09-2024 T1 247 C204.2
applications &Chalk

UNIT III - SORTING AND SEARCHING

SYLLABUS:
Bubble sort – selection sort – insertion sort – merge sort – quick sort – analysis of sorting algorithms – linear
search – binary search – hashing – hash functions – collision handling – load factors, rehashing, and efficiency
UNIT OBJECTIVES:
 To understand sorting, searching, and hashing algorithms
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Bubble sort, selection sort Black Board
19 04 04-09-2024 T1 386 C204.3
&Chalk
insertion sort, merge sort Black Board
20 08 05-09-2024 T1 538 C204.3
&Chalk
quick sort Black Board
21 02 06-09-2024 T1 550 C204.3
&Chalk
 analysis of sorting algorithms Black Board
22 04 06-09-2024 T1 567 C204.3
&Chalk
linear search Black Board
23 04 11-09-2024 T1 412 C204.3
&Chalk
binary search Black Board
24 08 12-09-2024 T1 155 C204.3
&Chalk
Hashing, hash functions Black Board
25 04 13-09-2024 T1 411 C204.3
&Chalk
collision handling Black Board
26 04 18-09-2024 T1 417 C204.3
&Chalk
load factors, rehashing, and Black Board
27 08 19-09-2024 T1 420 C204.3
efficiency &Chalk

UNIT IV- TREE STRUCTURES

SYLLABUS:
Tree ADT – Binary Tree ADT – tree traversals – binary search trees – AVL trees – heaps – multiway search
trees
UNIT OBJECTIVES:
To apply Tree structures
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Tree ADT Black Board
28 02 20-09-2024 T1 305 C204.4
&Chalk
Binary Tree ADT Black Board
29 04 20-09-2024 T1 313 C204.4
&Chalk
tree traversals Black Board
30 04 25-09-2024 T1 328 C204.4
&Chalk
binary search trees Black Board
31 08 26-09-2024 T1 460 C204.4
&Chalk
AVL trees Black Board
32 04 27-09-2024 T1 481 C204.4
&Chalk
AVL trees Black Board
33 01 30-09-2024 T1 481 C204.4
&Chalk
heaps Black Board
34 01 01-10-2024 T1 370 C204.4
&Chalk
multiway search trees Black Board
35 04 03-10-2024 T1 502 C204.4
&Chalk
multiway search trees Black Board
36 08 04-10-2024 T1 502 C204.4
&Chalk

UNIT V- GRAPH STRUCTURES

SYLLABUS:
Graph ADT – representations of graph – graph traversals – DAG – topological ordering – greedy algorithms –
dynamic programming – shortest paths – minimum spanning trees – introduction to complexity classes and
intractability
UNIT OBJECTIVES:
 Be exposed to graph algorithms
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Graph ADT Black Board
37 01 07-10-2024 T2 626 C204.5
&Chalk
representations of graph Black Board
38 01 08-10-2024 T2 627 C204.5
&Chalk
 graph traversals Black Board
39 04 09-10-2024 T2 638 C204.5
&Chalk
DAG, topological ordering Black Board
40 08 10-10-2024 T2 655 C204.5
&Chalk
greedy algorithms Black Board
41 04 16-10-2024 T2 603 C204.5
&Chalk
dynamic programming Black Board
42 08 17-10-2024 T2 594 C204.5
&Chalk
shortest paths Black Board
43 04 18-10-2024 T2 659 C204.5
&Chalk
minimum spanning trees Black Board
44 04 23-10-2024 T2 670 C204.5
&Chalk
introduction to complexity Black Board
45 08 24-10-2024 R5 432 C204.5
classes and intractability &Chalk

TEXT BOOKS:

1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &
Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021

REFERENCE:

1. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition
2015
2. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011
3. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to
Algorithms", Second Edition, McGraw Hill, 2002.
5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson
Education, 2014
6. Herbert Schildt, “Java: The Complete Reference”, 11 th Edition, McGraw Hill Education, New
Delhi, 2019

Staff in - Charge Course Coordinator HOD Vice-Principal Principal