SCHOOL OF COMPUTING

DEPARTMENT OF INFORMATION TECHNOLOGY

LESSON PLAN

Programme : B.Tech – Information Technology

Course Code /Course Name : 10211IT117 / Data Structures and Algorithms

Year/Semester : 2024-25 / Summer

Course Handling Faculty Name : Lijetha C Jaffrin

Slot No : S1

A. Preamble:
This course aims at molding the learner to understand the various data structures, their
organization and operations. The course helps the learners to assess the applicability of
different data structures and associated algorithms for solving real world problem.
B. Prerequisite Courses:

S.No Course Code Course Name

1 10210CS101 Problem Solving using C

C. Course Objectives:
Learners are exposed to:
• Understand basic elementary data structures.
• Illustrate the basic properties of Trees and Graphs.
• Implement various techniques of sorting and searching algorithms.
• Choose efficient data structure and apply them to solve problems.
C. Course Outcomes :
Upon the successful completion of the course, students will be able to:
CO
No’s Course Outcomes K - Level
Design modular algorithms to find solution for computational problem
CO1 with time and space complexities using suitable linear data structure. K3
Demonstrate the familiarity with tree data structure, rule to manipulate
CO2 those, and their canonical applications K3

Page 1 of 6
 Solve unstructured problem using balanced search tree algorithm, hashing
CO3 function. K3

CO4 Implement an appropriate algorithm using graph ADT for an application. K3

CO5 Apply sorting and searching techniques for real world problems. K3
Knowledge Level (Based on revised Bloom’s Taxonomy)
K1-Remember K2-Understand K3-Apply K4-Analyze K5-Evaluate K6-Create

E. Correlation of COs with POs :

PSO PSO PSO
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 1 2 3
CO1 3 3 3 2 1 1 3 3
CO2 3 3 3 2 1 1 3 3
CO3 3 3 3 3 1 1 2 3
CO4 3 3 3 3 1 1 3 3 2
CO5 3 3 2 2 1 1 2 3 2
3-High;2-Medium;1-Low
F. Course Contents
Unit 1 Introduction to Data Structure L-9 Hours
Introduction: Dynamic aspects of operations on data, Characteristics of data, Creation,
Manipulation and Operations on data, Data Structure and its types, Abstract Data Types (ADTs),
Analysis of algorithms and its Types, Asymptotic Notation. Arrays: Allocation, Operations and
Storage with one-dimensional arrays and multidimensional arrays. Stacks: Operations on Stacks,
Applications of Stacks, Queues: Operations and its types. Linked lists: Operations and Types of
linked list (singly, doubly and circularly linked list), Implementation of Stack and Queue using linked
list, Applications of Linked List. Case Study: Tower of Hanoi, Sparse matrix.
Unit 2 Trees L-9 Hours
Introduction to Trees – Definitions and concepts, Representation of Binary Tree, Types of
Binary tree, properties, structure and applications of binary tree, Binary Tree Traversal with
Recursive and Non-Recursive - Expression Tree, Binary Search Trees – Definition, Properties and
Operations of binary search tree. Priority Queue: Operations, Implementations- Heaps: properties and
types of Heaps, Binary Heap: Representation, Declaration and Creation of Heap, Heapifying,
Inserting and Deleting an element, Destroying Heap, Heap Sort. Case Study: Priority Queue in
bandwidth management
Unit 3 Special Trees & Hashing L-9 Hours
AVL Tree: Properties, Declarations, Rotations, Insertion, Deletion. B-Tree: Properties,
Insertion, Deletion –Trie: Insertion, Deletion, Searching. Hashing - Separate Chaining – Open
Addressing – Linear Probing – Quadratic Probing – Double Hashing –Rehashing.
Case Study: DNA sequence matching
Unit 4 Graphs L-9 Hours
Introduction to Graphs – Operations on graphs – Representation of Graph – Topological Sort
- Graph Traversal - Depth first search – Breadth First Search – Minimum Spanning Tree – Prim‟s
Algorithm- Kruskal’s Algorithm – Disjoint subsets and Union-Find algorithms – Shortest Path
Algorithms – Unweighted Shortest Paths –Dijkstra’s Algorithm. Applications of Graphs.
Case Study: Representing Google maps, Recommendations on e-commerce websites.
Page 2 of 6
Unit 5 Sorting, Searching L-9 Hours
Searching Techniques: Linear Search, Binary Search. Sorting techniques: Insertion Sort,
Selection sort, Merge sort, Quick Sort, Shell sort, Bubble sort, Counting sort, Bucket sort, Radix sort.
Case Study: Tim Sort
Total: 45 Hours
G. Learning Resources:
i. Text Book(s):
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson
Education, Reprinted edition 2013.[Unit 1,2,3]
2. Ellis Horowitz, Sartaj Sahni, Susan Anderson Freed, “Fundamentals of Data Structure in C”,
Universities Press,2017. [Unit 4,5]
ii. ReferenceBook(s):
1. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson
Education, First Edition, Reprint 2017.
2. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India Edition,
2007.
3. Seymour Lipschutz, “Data Structures with C”, Scham‟s outlines, Tata McGraw Hill, 2017.
iii. OnlineResources:
1. “Introduction to Data Structures and Algorithms” 31.12.2009. Accessed on Apr. 20, [Online].
Available: https://nptel.ac.in/courses/106/102/106102064/.
2. “Data Structures and algorithms”. Accessed on: Apr. 15, 2021 [Online]. Available:
https://www.coursera.org/specializations/data-structures-algorithms.
3. “Data structures Visualization” 2011. Accessed on: Apr. 15, 2021 [Online]. Available:
https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
4. “Data Structures Fundamentals” 2021, Accessed on: Apr. 20,2021 [Online]. Available:
https://www.edx.org/course/data-structures-fundamentals

Page 3 of 6
 LESSON PLAN

UNIT I–INTRODUCTION TO DATA STRCUTURE

CO1: Design modular algorithms to find solution for computational problem with time and
space complexities using suitable linear data structure.
S. Topic Name Content Delivery Planned Actual
No Methods Date Date
Course Orientation, Introduction:
1
Dynamic aspects of operations on data, Chalk & Talk,
27-06-24
Characteristics of data, Creation, PPT
Manipulation and Operations on data
Data Structure and its types, Abstract
2 Chalk & Talk, PPT 01-07-24
Data Types(ADTs)
Analysis of algorithms and its Types,
3 Chalk & Talk, PPT 02-07-24
Asymptotic Notation.
Arrays: Allocation, Operations and
4 Storage with one-dimensional arrays and Chalk & Talk, PPT 04-07-24
multidimensional arrays.
Stacks: Operations on Stacks, ALM (EL):
5 08-07-24
Applications of Stacks Think-Pair-share
ICT Tool: Visualgo
6 Queues: Operations and its types. 09-07-24
visualization tool
Linkedlists:OperationsandTypesoflink
7 edlist(singly,doublyandcircularlylinked ALM : SWOT Analysis 11-07-24
list)
Implementation of Stack and Queue
Chalk & Talk,
8 using linked list, Applications of Linked 15-07-24
PPT
List.
Case Study: Tower of Hanoi, Sparse Chalk & Talk,
9 16-07-24
matrix PPT
UNIT II-TREES
CO2: Demonstrate the familiarity with tree data structure, rule to manipulate those, and their
canonical applications.
S. Topic Content Delivery Planne Actual
No Name Methods d Date
Date
Introduction to Trees – Definitions and
10 Chalk & Talk, PPT 18-07-24
concepts, Representation of Binary Tree
Types of Binary tree, properties, structure and
11 Chalk & Talk, PPT 22-07-24
applications of binary tree
Binary Tree Traversal with Recursive
12 Chalk & Talk, PPT 23-07-24
and Non-Recursive - Expression Tree
Binary Search Trees – Definition,
13 Properties and Operations of binary search ALM : One minute paper 25-07-24
tree
14 Priority Queue: Operations, Implementations Chalk & Talk, PPT 29-07-24
Page 4 of 6
15 Heaps: properties and types of Heaps ICT Tool: Algoanim 30-07-24
Binary Heap: Representation, Declaration and
16 Chalk & Talk, PPT 01-08-24
Creation of Heap
Heapifying, Inserting and Deleting an element,
17 Chalk & Talk, PPT 08-08-24
Destroying Heap, Heap Sort
Case Study: Priority Queue in bandwidth
18 Chalk & Talk, PPT 12-08-24
management
UNIT III–SPECIAL TREES & HASHING
CO3:Solve unstructured problem using balanced search tree algorithm, hashing function.
S. Topic Planne Actual
Content Delivery
No Name d Date
Methods
Date
AVL Tree: Properties, Declarations,
19 ICT Tool: USFCA 13-08-24
Rotations, Insertion, Deletion
Chalk & Talk, PPT
20 B-Tree: Properties, Insertion, Deletion 19-08-24
ALM: Mind map
21 Trie: Insertion, Deletion, Searching Chalk & Talk, PPT 20-08-24
ALM (EL): Learning By
22 Hashing-Separate Chaining 22-08-24
Doing
23 Open Addressing Chalk & Talk, PPT 27-08-24
24 Linear Probing Chalk & Talk, PPT 29-08-24
25 Quadratic Probing Chalk & Talk, PPT 02-09-24
26 Double Hashing–Rehashing Chalk & Talk, PPT 03-09-24
27 Case Study: DNA sequence matching Chalk & Talk, PPT 05-09-24
UNIT IV-GRAPHS
CO4: Implement an appropriate algorithm using graph ADT for an
application.
S. Topic Planne Actual
Content Delivery
No Name d Date
Methods
Date
Introduction to Graphs – Operations on graphs
28 ALM: Crossword puzzle 12-09-24
– Representation of Graph – Topological Sort
29 Graph Traversal - Depth first search Chalk & Talk, PPT 16-09-24
30 Graph Traversal – Breadth first search Chalk & Talk, PPT 19-09-24
31 Minimum Spanning Tree – Prim’s Algorithm Chalk & Talk, PPT 23-09-24
32 Kruskal’s Algorithm–Disjoint subsets Chalk & Talk, PPT 24-09-24
33 Union-Find algorithms Chalk & Talk, PPT 26-09-24
Shortest Path Algorithms–Unweighted
34 Chalk & Talk, PPT 30-09-24
Shortest Paths
Dijkstra’s Algorithm, Application of ALM: Learning by d
35 01-10-24
Graphs doing
Case Study: Representing Google Maps,
36 Chalk & Talk, PPT 03-10-24
Recommendation on e-commerce websites
UNIT V–SORTING & SEARCHING
CO5:Apply sorting and searching techniques for real world problems.
S. Topic Content Delivery Planne Actual
Page 5 of 6
 No Name Methods d Date
Date
37 Searching Techniques: Linear Search Chalk & Talk, PPT 07-10-24
ICT Tool: Code 08-10-24
38 Searching Techniques: Binary Search
Pen
39 Insertion Sort, Selection sort Chalk & Talk, PPT 10-10-24
40 Merge Sort Chalk & Talk, PPT 14-10-24
41 Quick Sort ALM: Learning By Doing 15-10-24
42 Shell Sort, Bubble Sort Chalk & Talk, PPT 17-10-24
43 Counting sort, Bucket sort Chalk & Talk, PPT 21-10-24
44 Radix Sort Chalk & Talk, PPT 22-10-24
45 Case Study: Tim Sort Chalk & Talk, PPT 24-10-24

Course Handling Faculty HOD/IT

Date:

Note:
 Bolded topics – Recommended topics for improvement of COs based on previous attainment

 Student Centric Methods: Participative Learning (PL), Project Based Learning (PJBL), Problem
Based Learning (PBL), Experiential Learning (EL)
 ICT – Information and Communication Technology Tools

 PPT – Power Point Presentations

 Demo - Demonstration

Page 6 of 6