Printed on 7/14/2025 1:22:02 PM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering -

OF ENGINEERING (UIE) Computer Science & Engineering
(CS201)
Master Subject Coordinator Bhavneet Kaur Master Subject Coordinator E- E14414
Name: Code:
Course Name Advanced Data Structures Course Code 24CSH-202
and Algorithms

Lecture Tutorial Practical Self Study Credit Subject Type

3 0 2 0 4.00 T

Course Type Course Category Mode of Assessment Mode of Delivery

N.A Graded (GR) Hybrid Hybrid (HYB)

Mission of the M1: To provide practical knowledge using state-of-the-art technological support for the experiential learning of our students.
Department M2: To provide industry recommended curriculum and transparent assessment for quality learning experiences.
M3: To create global linkages for interdisciplinary collaborative learning and research.
M4: To nurture advanced learning platform for research and innovation for students’ profound future growth.
M5: To inculcate leadership qualities and strong ethical values through value based education.
Vision of the To be recognized as a leading Computer Science and Engineering department through effective teaching practices and
Department excellence in research and innovation for creating competent professionals with ethics, values and entrepreneurial attitude to
deliver service to society and to meet the current industry standards at the global level.

Program Educational Objectives(PEOs)

PEO1 Engage in successful careers in industry, academia, and public service, by applying the acquired knowledge of Science,
Mathematics and Engineering, providing technical leadership for their business, profession and community.
PEO2 Establish themselves as entrepreneur, work in research and development organization and pursue higher education.

PEO3 Exhibit commitment and engage in lifelong learning for enhancing their professional and personal capabilities.

Program Specific OutComes(PSOs)

PSO1 Exhibit attitude for continuous learning and deliver efficient solutions for emerging challenges in the computation domain.

PSO2 Apply standard software engineering principles to develop viable solutions for Information Technology Enabled Services (ITES).

Program OutComes(POs)
PO1 PO 1: Disciplinary knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering
specialisation for the solution of complex engineering problems.
PO2 PO 2: Complex problem solving

PO3 PO 3: Critical Thinking

PO4 PO 4:Creativity-Create, perform, or think in different and diverse ways about the given scenarios

PO5 PO 5: Communication skills: Communicate effectively on complex engineering activities with the engineering community and with
the 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
PO6 PO 6: Analytical reasoning/thinking: Identify, formulate, research literature, and analyse complex engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PO7 PO 7: Research related skills: Design solutions for complex engineering problems and design system components or processes
that meet the specified needs with appropriate consideration for public health and safety, and cultural, societal, and environmental
considerations.
PO8 PO 8: Coordinating/Collaborating with others: Function effectively as an individual, and as a member or leader in diverse teams,
and in multidisciplinary settings.

University Information System - By - ERP Division Page 1 of 7

 Printed on 7/14/2025 1:22:02 PM
LECTURE PLAN

PO9 PO 9: Leadership qualities: 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.
PO10 PO 10: Learning how to learn skills: Recognise the need for, and have the preparation and ability to engage in independent and
life-long learning in the broadest context of technological change.
PO11 PO11 : Digital and technological skills: Create, select, and apply appropriate techniques, resources, and modern engineering and
IT tools including prediction and modelling to complex engineering activities with an understanding of the limitations.
PO12 PO 12: Multicultural Competence and Inclusive Spirit

PO13 PO 13: Value inculcation: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.
PO14 PO 14: Autonomy, responsibility and accountability: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
PO15 PO 15: Environmental awareness and action: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and the need for sustainable development.
PO16 PO 16: Community Engagement & Services

PO17 PO 17: Empathy 17.1 Identify with or understand the perspective, experiences, or points of view of another individual or group,
and to identify and understand other people’s emotions

Text Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 “Data Structures and Algorithm Mark Allen Weiss 4th edition Pearson 2014
Analysis in C++"
2 Introduction to Algorithms Thomas H. Cormen, Charles E. 4th edition MIT Press 2022
Leiserson, Ronald L.

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Algorithms in C++ Robert Sedgewick, Addison- Third Edition Addison-Wesley 2009
Wesley Professional
2 Data Structures and Algorithms in Adam Drozdek 4th Edition Cengage Learning 2012
C++

Course OutCome
SrNo OutCome
CO1 Review and classify the time and space complexity of algorithms using asymptotic notations and solve
recurrence relations.
CO2 Implement and compare various sorting techniques and searching algorithms for linear data structures.
CO3 Develop programs for linear and nonlinear data structures such as linked lists, stacks, queues, and
trees.
CO4 Evaluate efficient storage and retrieval techniques using hashing and balanced tree structures.
CO5 Design and implement graph algorithms and apply dynamic programming techniques to solve real-world
problems.

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 1.1 Asymptotic Notations-Big O, Theta, ,T-“Data Structures and PPT CO1
Omega Algorithm,R-Algorithms in C++
1 2 1.1 Reccursion,Methods of solving ,T-“Data Structures and PPT CO1
recurrences Relations Algorithm,R-Algorithms in C++

University Information System - By - ERP Division Page 2 of 7

 Printed on 7/14/2025 1:22:02 PM
LECTURE PLAN

1 3 1.1 Recursion tree ,T-“Data Structures and PPT CO1

Algorithm,R-Algorithms in C++
1 4 1.1 Back propagation method ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 5 1.1 Master method ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 6 1.2 Quick sort -Concept & Algorithm ,T-“Data Structures and PPT CO2
Algorithm,R-Algorithms in C++
1 7 1.2 Complexity Analysis of Quick sort ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 8 1.2 Radix sort-Concept & Algorithm ,T-“Data Structures and PPT CO2
Algorithm,R-Algorithms in C++
1 9 1.2 Complexity Analysis of Radix sort ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 10 1.2 Merge sort-Concept & Algorithm ,T-“Data Structures and PPT CO2
Algorithm,R-Algorithms in C++
1 11 1.2 Complexity Analysis of Merge sort ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 12 1.2 Bucket Sort-Concept & Algorithm ,T-“Data Structures and PPT CO2
Algorithm,R-Algorithms in C++
1 13 1.2 Complexity Analysis of Bucket Sort ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 14 1.1 Revision of Complexity Analysis ,T-“Data Structures and PPT CO1
Algorithm,R-Algorithms in C++
1 15 1.2 Revision of sorting techniques ,T-“Data Structures and PPT CO2
Algorithm,R-Algorithms in C++
2 16 2.1 Linked lists -Introduction,Single Linked ,T-“Data Structures and PPT CO3
List Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 17 2.1 Linked List operations on a single ,T-“Data Structures and PPT CO3
linked list Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 18 2.1 Doubly linked lists ,T-“Data Structures and PPT CO3
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 19 2.1 Linked List operations on doubly linked ,T-“Data Structures and PPT CO3
lists Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 20 2.1 Linked list based implementations for ,T-“Data Structures and PPT CO3
Queue and Stack Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 21 2.1 Linked list based implementations for ,T-“Data Structures and PPT CO3
Queue and Stack Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 22 2.2 Introduction to rooted trees ,T-“Data Structures and PPT CO3
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 23 2.2 Binary tress ,T-“Data Structures and PPT CO3
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 24 2.2 Binary Search Trees ,T-“Data Structures and PPT CO3
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms

University Information System - By - ERP Division Page 3 of 7

 Printed on 7/14/2025 1:22:02 PM
LECTURE PLAN

2 25 2.2 Traversal of trees ,T-“Data Structures and PPT CO3

Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 26 2.2 Traversal of trees ,T-“Data Structures and PPT CO3
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 27 2.2 Balanced search trees ,T-“Data Structures and PPT CO4
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 28 2.2 Introduction B-Tree,Heap Sort ,T-“Data Structures and PPT CO2
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 29 2.3 Introduction to hashing ,T-“Data Structures and PPT CO4
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
2 30 2.3 Collision avoidance mechanism ,T-“Data Structures and PPT CO4
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 31 3.1 Graph Traversal in data structures ,T-“Data Structures and PPT CO3
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 32 3.1 Graph Traversal in data structures ,T-“Data Structures and PPT CO5
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 33 3.2 Shortest Paths in Graphs-Dijkstra’s ,T-“Data Structures and PPT CO5
algorithm and applications Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 34 3.2 Huffman Coding ,T-“Data Structures and PPT CO4
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 35 3.2 Minimum Spanning Trees ,T-“Data Structures and PPT CO5
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 36 3.2 Prims algorithm ,T-“Data Structures and PPT CO4
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 37 3.2 Prims algorithm-Complexity Analysis ,T-“Data Structures and PPT CO1
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 38 3.2 Kruskals algorithm ,T-“Data Structures and PPT CO5
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 39 3.2 Complexity analysis of Kruskals ,T-“Data Structures and PPT CO1
algorithm Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 40 3.3 Introduction to Dynamic Programming ,T-“Data Structures and PPT CO5
and applications Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms

University Information System - By - ERP Division Page 4 of 7

 Printed on 7/14/2025 1:22:02 PM
LECTURE PLAN

3 41 3.3 Bellman Ford Algorithm ,T-“Data Structures and PPT CO5

Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 42 3.3 Complexity analysis of Bellman Ford ,T-“Data Structures and PPT CO1
Algorithm Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 43 3.3 Knapsack with and without repetition ,T-“Data Structures and PPT CO5
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 44 3.3 Complexity analysis of Knapsack with ,T-“Data Structures and PPT CO1
and without repetition Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms
3 45 3.3 Revision ,T-“Data Structures and PPT CO5
Algorithm,T-Introduction to
Algorithms,R-Algorithms in C++,R-
Data Structures and Algorithms

Lecture Plan Preview-Practical

Mapped with CO
Unit No ExperimentNo Experiment Name Text/ Reference Books Pedagogical Tool**
Numer(s)
1 1 Given an integer n, ,T-“Data Structures and Algorithm,T- PPT CO1,CO3
return true if it is a Introduction to Algorithms,R-Algorithms in
power of two, C++,R-Data Structures and Algorithms
otherwise return false.
An integer n is a
power of two if there
exists an integer x
such that n == 2^x.
Implement the solution
using recursion.

1 2 In an array, an ,T-“Data Structures and Algorithm,T- PPT CO3,CO4

inversion is a pair of Introduction to Algorithms,R-Algorithms in
elements that are out C++,R-Data Structures and Algorithms
of order, meaning for
indices i and j where i
< j, if arr[i] > arr[j], they
form an inversion. The
task is to count the
number of such
inversions required to
sort the array using
Merge Sort.

1 3 Compare the running ,T-“Data Structures and Algorithm,T- PPT CO4,CO5

time of Quick Sort (in- Introduction to Algorithms,R-Algorithms in
place) and Insertion C++,R-Data Structures and Algorithms
Sort by counting the
number of swaps or
shifts required and
outputting the
difference.
2 4 Given the head of a ,T-“Data Structures and Algorithm,T- PPT CO1,CO3
singly linked list, Introduction to Algorithms,R-Algorithms in
return the middle node C++,R-Data Structures and Algorithms
of the linked list. If
there are two middle
nodes, return the
second middle node.

University Information System - By - ERP Division Page 5 of 7

 Printed on 7/14/2025 1:22:02 PM
LECTURE PLAN

2 5 Given a pointer to the ,T-“Data Structures and Algorithm,T- PPT CO1,CO3

root of a binary tree, Introduction to Algorithms,R-Algorithms in
you need to print the C++,R-Data Structures and Algorithms
level order traversal of
this tree, where nodes
are visited level by
level from left to
right?.

2 6 Given a Binary Search ,T-“Data Structures and Algorithm,T- PPT CO1,CO3,CO5

Tree (BST) and two Introduction to Algorithms,R-Algorithms in
nodes, find the lowest C++,R-Data Structures and Algorithms
common ancestor
(LCA) of the two
nodes.

3 7 You are given a ,T-“Data Structures and Algorithm,T- PPT CO2,CO3,CO5

weighted graph with N Introduction to Algorithms,R-Algorithms in
nodes and M edges. C++,R-Data Structures and Algorithms
Your task is to find the
shortest path from a
given starting node to
all other nodes using
Dijkstra’s Algorithm. If
a node is not
reachable, print -1 as
the distance.
3 8 Given a string ,T-“Data Structures and Algorithm,T- PPT CO1,CO3,CO5
containing lowercase Introduction to Algorithms,R-Algorithms in
English letters, your C++,R-Data Structures and Algorithms
task is to build a
Huffman Tree and use
it to generate the
Huffman codes for
each character.

3 9 Find Critical and ,T-“Data Structures and Algorithm,T- PPT CO3,CO4,CO5

Pseudo-Critical Edges Introduction to Algorithms,R-Algorithms in
in Minimum Spanning C++,R-Data Structures and Algorithms
Tree

3 10 You are given a list of ,T-“Data Structures and Algorithm,T- PPT CO3,CO5
flights, where each Introduction to Algorithms,R-Algorithms in
flight is represented as C++,R-Data Structures and Algorithms
(src, dst, price),
indicating a flight from
src to dst with a cost
of price. You are also
given the number of
cities n, a source city
src, a destination city
dst, and an integer K,
representing the
maximum number of
stops allowed. Your
task is to find the
cheapest price from
src to dst with at most
K stops. If there is no
such route, return -1.

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 Exp. Learning(CSE) Attendance Marks 2
2 Exp. Learning(CSE) MST-1 Hybrid 20

University Information System - By - ERP Division Page 6 of 7

 Printed on 7/14/2025 1:22:02 PM
LECTURE PLAN

3 Exp. Learning(CSE) MST-2 Hybrid 20

4 Exp. Learning(CSE) Experiment 1(CSE) 30
5 Exp. Learning(CSE) Experiment 2(CSE) 30
6 Exp. Learning(CSE) Experiment 3(CSE) 30
7 Exp. Learning(CSE) Experiment 4(CSE) 30
8 Exp. Learning(CSE) Class Performance(CSE) 10
9 Exp. Learning(CSE) End Term Assessment Pr 40
(CSE)
10 Exp. Learning(CSE) Assignment/PBL 10
11 Exp. Learning(CSE) Quiz 4
12 Exp. Learning(CSE) Surprise Test(CSE) 12
13 Exp. Learning(CSE) End Term Assessment TH 60
(CSE)
14 Exp. Learning(CSE) Course Project 5
15 Exp. Learning(CSE) Industry Aligned 10
Assessment(Hybrid)

University Information System - By - ERP Division Page 7 of 7