Printed on 12/24/2024 6:28:11 PM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering (Artificial

OF ENGINEERING (UIE) Intelligence and Data Science)
(AI201)
Master Subject Coordinator Abhishek Pandey Master Subject Coordinator E- E17100
Name: Code:
Course Name Design and Analysis of Course Code 23CSH-282
Algorithm

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

Major Core Graded (GR) Hybrid Hybrid (HYB)

Mission of the M1 To provide relevant, rigorous and contemporary curriculum and aligned assessment system to ensure effective learning
Department outcomes for engineering technologies.
M2 To provide platform for industry engagement aimed at providing hands-on training on advanced technological and business
skills to our students.
M3 To provide opportunities for collaborative, interdisciplinary and cutting-edge research aimed at developing solutions to real life
problems.
M4 To imbibe quest for innovation, continuous learning and zeal to pursue excellence through hard work and problem-solving
approach.
M5 To foster skills of leadership, management, communication, team spirit and strong professional ethics in all academic and
societal endeavors of our students.

Vision of the To be recognized as a centre of excellence for Computer Science & Engineering education and research, through effective
Department teaching practices, hands-on training on cutting edge computing technologies and excellence in innovation, for creating globally
aware competent professionals with strong work ethics whom would be proficient in implementing modern technology solutions
and shall have entrepreneurial zeal to solve problems of organizations and society at large.

Program Educational Objectives(PEOs)

PEO1 To be able to explore areas of research, technology application & innovation and make a positive impact in different types of
institutional settings such as corporate entities, government bodies, NGOs, inter-government organizations, & start-ups.
PEO2 To be able to design, and implement technology and computing solutions to organizational problems, effectively deploy knowledge
of engineering principles, demonstrate critical thinking skills & make the intellectual connections between quantitative and
qualitative tools, theories, and context to solve the organizational problems
PEO3 To be able to work with, lead & engage big and small teams comprising diverse people in terms of gender, nationality, region,
language, culture & beliefs. To understand stated and unstated differences of views, beliefs & customs in diverse &
interdisciplinary team settings
PEO4 To be able to continuously learn and update one’s knowledge, engage in lifelong learning habits and acquire latest knowledge to
perform in current work settings
PEO5 To continuously strive for justice, ethics, equality, honesty, and integrity both in personal and professional pursuits. Able to
understand and conduct in a way that is responsible and respectful.

Program Specific OutComes(PSOs)

PSO1 The graduate student shall be able to analyse and make valuable contributions in the design, development, and production of
computer science and related engineering applications in the areas of Artificial intelligence and Machine learning.
PSO2 The graduate student shall be able to use the latest software tools and technologies related to Artificial intelligence and Machine
learning and ability to practice as an engineer/researcher in the evolving field of AI and ML and its allied application domains by
employing project
PSO3 The graduate student shall be able to analyse and exhibit proficiency in Artificial Intelligence and Data Analytics for providing
solutions to real-world problems in Industry and Research establishments

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

Program OutComes(POs)
PO1 Apply the knowledge of mathematics, science, engineering fundamentals and an engineering specialization to the solution of
complex engineering problems.
PO2 Identify, formulate, review research literature and analyze complex engineering problems reaching substantiated conclusions
using first principles of mathematics, natural sciences and engineering sciences.
PO3 Design solutions for complex engineering problems and design system components or processes that meet the specified needs
with appropriate consideration for the public health and safety and the cultural, societal, and environmental considerations.
PO4 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.
PO5 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 limitationsPO4 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.
PO6 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
PO7 Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.
PO8 Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice

PO9 Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.

PO10 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.
PO11 Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as
member and leader in a team, to manage projects and in multidisciplinary environments.
PO12 Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest
context to technological change.
PO13 Demonstrate the capability to apply analytic thought to a body of knowledge, including the analysis and evaluation of policies, and
practices. Identify relevant assumptions or implications, logical flaws and loopholes in the presented arguments
PO14 Demonstrate to create, perform, or think in different and diverse ways about the given scenario. Innovate and perform tasks in a
better manner, view a problem or a situation from multiple perspectives, think ‘out of the box’ and generate solutions to complex
problems in unfamiliar contexts
PO15 Demonstrate the ability to 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
PO16 Demonstrate the ability to participate in community-engaged services/ activities for promoting the well-being of society

PO17 Demonstrate the acquisition of knowledge of the values and beliefs of multiple cultures, capability to effectively engage in a
multicultural group/society and interact respectfully with diverse groups and gender sensitivity and adopting a gender-neutral
approach, as also empathy for the less advantaged and the differently-abled including those with learning disabilities.

Text Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Introduction to Algorithms by Thomas H. Cormen, Charles 3RD edition PHI Learning 2012
E. Leiserson, Ronald Private Limited
2 Introduction to the Design and Anany Levitin 3RD edition Pearson Education 2012
Analysis of Algorithms

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Design & Analysis of Computer Alfred V Aho, John E Hopcroft, 1ST edition Pearson Education 2013
Algorithms Jeffrey D Ullman Limited
2 Fundamentals of Computer Ellis Horowitz, Sartaj Sahni, and 2ND edition Universities Press 2012
Algorithms Sanguthevar Raja

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

Course OutCome
SrNo OutCome
CO1 Recall and describe fundamental concepts of algorithms, including basic design techniques such as
divide-and-conquer, greedy methods, dynamic programming, and backtracking.
CO2 Understand the principles of algorithm design and the trade-offs between time complexity, space
complexity, and optimality in problem-solving.
CO3 Apply algorithmic strategies like dynamic programming or graph traversal techniques to solve
computational problems in diverse domains.
CO4 Implement algorithmic solutions for real-world problems using appropriate programming languages and
tools, demonstrating an understanding of efficiency and correctness.
CO5 Analyze the efficiency of algorithms by deriving and comparing their time and space complexity using
asymptotic notations.

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 Algorithm Analysis Framework: Worst-case T-Introduction to Algorithms ,T- PPT,Simulati CO1
Performance analysis, Introduction to the Design and on,Video
Analysis Average case analysis, and Best case Lecture
analysis

1 2 Algorithm Asymptotic notations: Oh notation, ,T-Introduction to Algorithms ,R- Case CO1

Performance Omega notation, and Theta notation Fundamentals of Computer Algor Study,PPT
Analysis
1 3 Algorithm Algorithm performance analysis: Time ,T-Introduction to Algorithms ,R- PPT,Simulati CO1
Performance complexity and Space complexity Design & Analysis of Computer on,Video
Analysis Lecture
1 4 Algorithm Analysis of iterative algorithms. T-Introduction to Algorithms ,T- PPT,Video CO2
Performance Introduction to the Design and Lecture
Analysis
1 5 Algorithm Analysis of recursive algorithms. T-Introduction to Algorithms ,T- PPT,Simulati CO2
Performance Introduction to the Design and on,Video
Analysis Lecture
1 6 Algorithm Recurrence equations and their ,T-Introduction to Algorithms ,T- PPT,Simulati CO3
Performance solution: Introduction to the Design and,R- on,Video
Analysis substitution method Design & Analysis of Computer Lecture

1 7 Algorithm Recurrence equations and their ,T-Introduction to Algorithms ,R- PPT,Simulati CO3
Performance solution: master theorem Design & Analysis of Computer on,Video
Analysis Lecture
1 8 Algorithm Recurrence equations and their T-Introduction to Algorithms ,T- PPT CO3
Performance solution: recursion tree method Introduction to the Design and
Analysis
1 9 Divide and Divide and Conquer: Understanding of ,T-Introduction to Algorithms ,R- PPT CO1
Conquer the Divide and conquer approach Design & Analysis of Computer
1 10 Divide and Algorithms for Find Min and Max T-Introduction to Algorithms ,T- PPT,Reports CO1
Conquer Introduction to the Design and ,Simulation,
Video
Lecture
1 11 Divide and Sorting : Quick Sort and Heap Sort ,T-Introduction to Algorithms ,T- PPT,Simulati CO1
Conquer Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
1 12 Divide and Sorting : 2 - Way Merge Sort ,T-Introduction to Algorithms ,R- PPT CO2
Conquer Design & Analysis of Computer
1 13 Divide and Linear Search and Binary Search. ,T-Introduction to Algorithms ,R- PPT,Simulati CO2
Conquer Design & Analysis of Computer on,Video
Lecture

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

1 14 Divide and Strassen's matrix multiplication and ,T-Introduction to Algorithms ,R- PPT,Simulati CO2
Conquer convex hull Design & Analysis of Computer on,Video
Lecture
1 15 Divide and Decrease and Conquer Approach: ,T-Introduction to Algorithms ,T- Activity,Case CO3
Conquer Topological Introduction to the Design and,R- Study,PPT,S
Sort. Design & Analysis of Computer imulation,Vid
,R-Fundamentals of Computer Algor eo Lecture
1 16 Greedy Method Greedy Method: Understanding of the T-Introduction to Algorithms ,T- PPT,Video CO1
greedy approach Introduction to the Design and Lecture
2 17 Greedy Method Greedy Algorithms for Knapsack ,T-Introduction to Algorithms ,T- PPT,Video CO2
Fractional Problem Introduction to the Design and,R- Lecture
Design & Analysis of Computer
2 18 Greedy Method Greedy algorithms for Job Sequencing ,T-Introduction to Algorithms ,T- Instructor CO2
Problems with the deadline and Introduction to the Design and,R- Lead
Design & Analysis of Computer WorkShop,P
,R-Fundamentals of Computer Algor PT,Professo
r of
Practice/Adj
unct
Faculty/Visiti
ng
Professor,Si
mulation,Vid
eo Lecture
2 19 Greedy Method Huffman Coding ,T-Introduction to Algorithms ,T- Activity,Flipp CO3
Introduction to the Design and,R- ed
Design & Analysis of Computer Classes,Instr
,R-Fundamentals of Computer Algor uctor Lead
WorkShop,P
PT,Professo
r of
Practice/Adj
unct
Faculty/Visiti
ng
Professor,Si
mulation,Vid
eo Lecture
2 20 Greedy Method Minimum Spanning Tree: Prims ,T-Introduction to Algorithms ,T- Flipped CO3
Algorithm and Kruskal Algorithm Introduction to the Design and,R- Classes,Info
Design & Analysis of Computer graphics,Inst
,R-Fundamentals of Computer Algor ructor Lead
WorkShop,P
PT,Professo
r of
Practice/Adj
unct
Faculty/Visiti
ng
Professor,Si
mulation,Vid
eo Lecture
2 21 Greedy Method Activity Selection problem ,T-Introduction to Algorithms ,T- Activity,Case CO2
Introduction to the Design and,R- Study,PPT,R
Design & Analysis of Computer eports,Simul
ation,Video
Lecture
2 22 Dynamic Dynamic Programming: Understanding ,T-Introduction to Algorithms ,T- Activity,Case CO1
Programming of dynamic programming approach Introduction to the Design and,R- Study,Infogr
Design & Analysis of Computer aphics,PPT,
,R-Fundamentals of Computer Algor Reports,Sim
ulation,Video
Lecture

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

2 23 Dynamic Algorithms for 0/1 Knapsack problem ,T-Introduction to Algorithms ,T- Case CO2
Programming Introduction to the Design and,R- Study,Flippe
Design & Analysis of Computer d
,R-Fundamentals of Computer Algor Classes,Info
graphics,Inst
ructor Lead
WorkShop,P
PT,Reports,
Simulation,V
ideo Lecture
2 24 Dynamic Longest Common Subsequence ,T-Introduction to Algorithms ,T- PPT,Simulati CO3
Programming problem Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
,R-Fundamentals of Computer Algor
2 25 Dynamic Single Source Shortest Path: Bellman- ,T-Introduction to Algorithms ,R- Case CO2
Programming Ford Algorithm. Design & Analysis of Computer Study,Flippe
d
Classes,Info
graphics,PP
T,Reports,Si
mulation,Vid
eo Lecture
2 26 Dynamic All-Pair shortest path problem: Floyd- ,T-Introduction to Algorithms ,T- Case CO2
Programming Warshall algorithm. Introduction to the Design and,R- Study,Infogr
Design & Analysis of Computer aphics,PPT,
,R-Fundamentals of Computer Algor Reports,Sim
ulation,Video
Lecture
2 27 Dynamic OBST ,T-Introduction to Algorithms ,T- PPT,Simulati CO3
Programming Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
,R-Fundamentals of Computer Algor
2 28 Dynamic Matrix Chain Multiplication, ,T-Introduction to Algorithms ,T- Case CO3
Programming Introduction to the Design and,R- Study,Flippe
Design & Analysis of Computer d
,R-Fundamentals of Computer Algor Classes,PPT
,Reports,Sim
ulation,Video
Lecture
2 29 Dynamic Coin Change Problem ,T-Introduction to Algorithms ,T- Case CO3
Programming Introduction to the Design and,R- Study,Infogr
Design & Analysis of Computer aphics,PPT,
,R-Fundamentals of Computer Algor Simulation,V
ideo Lecture
2 30 Dynamic Travelling Salesman Problem ,T-Introduction to the Design and,R- PPT,Simulati CO2
Programming Fundamentals of Computer Algor on,Video
Lecture
3 31 Backtracking Back Tracking: Understanding of Back ,T-Introduction to Algorithms ,T- PPT,Video CO1
Tracking, Recursive Back Tracking, and Introduction to the Design and,R- Lecture
Iterative Design & Analysis of Computer
Back Tracking ,R-Fundamentals of Computer Algor

3 32 Backtracking N-Queen’s Problem ,T-Introduction to Algorithms ,T- Case CO3

Introduction to the Design and,R- Study,Infogr
Design & Analysis of Computer aphics,PPT,
,R-Fundamentals of Computer Algor Simulation,V
ideo Lecture
3 33 Backtracking Graph coloring Problem ,T-Introduction to Algorithms ,T- Infographics, CO3
Introduction to the Design and,R- Instructor
Design & Analysis of Computer Lead
,R-Fundamentals of Computer Algor WorkShop,P
PT,Simulatio
n,Video
Lecture

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

3 34 Backtracking Hamiltonian Cycle ,T-Introduction to Algorithms ,T- PPT,Simulati CO3

Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
,R-Fundamentals of Computer Algor
3 35 Backtracking Understanding of Lower-Bound Theory ,T-Introduction to Algorithms ,T- Flipped CO2
Introduction to the Design and,R- Classes,Instr
Design & Analysis of Computer uctor Lead
,R-Fundamentals of Computer Algor WorkShop,P
PT,Simulatio
n,Video
Lecture
3 36 Branch and Branch & Bound: Understanding of ,T-Introduction to Algorithms ,T- Activity,Case CO1
Bound Method Branch & Introduction to the Design and,R- Study,PPT,S
Bound Design & Analysis of Computer imulation,Vid
,R-Fundamentals of Computer Algor eo Lecture
3 37 Branch and Branch & Bound: FIFO Branch & Bound ,T-Introduction to Algorithms ,T- PPT,Simulati CO2
Bound Method Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
,R-Fundamentals of Computer Algor
3 38 Branch and Branch & Bound: Least Cost Branch & ,T-Introduction to Algorithms ,T- Flipped CO2
Bound Method Bound Introduction to the Design and,R- Classes,PPT
Design & Analysis of Computer ,Reports,Sim
,R-Fundamentals of Computer Algor ulation,Video
Lecture
3 39 Branch and 0/1 Knapsack problem using FIFO ,T-Introduction to Algorithms ,T- Flipped CO3
Bound Method Branch & Introduction to the Design and,R- Classes,Instr
Bound and LC Branch & Bound Design & Analysis of Computer uctor Lead
Solution ,R-Fundamentals of Computer Algor WorkShop,P
PT,Simulatio
n,Video
Lecture
3 40 Computational Introduction to Computational ,T-Introduction to Algorithms ,T- PPT,Video CO1
Complexity Complexity Introduction to the Design and,R- Lecture
Design & Analysis of Computer
,R-Fundamentals of Computer Algor
3 41 Computational Introduction to P, NP ,T-Introduction to Algorithms ,T- PPT,Simulati CO2
Complexity Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
,R-Fundamentals of Computer Algor
3 42 Computational NP-Hard & NP-Complete ,T-Introduction to Algorithms ,R- PPT,Simulati CO1
Complexity Fundamentals of Computer Algor on,Video
Lecture
3 43 Computational Deterministic algorithms & Non- ,T-Introduction to Algorithms ,T- PPT,Simulati CO2
Complexity deterministic algorithms Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
3 44 Computational Deterministic and Non-deterministic ,T-Introduction to Algorithms ,T- PPT,Simulati CO2
Complexity algorithms Introduction to the Design and,R- on,Video
Problems Design & Analysis of Computer Lecture

3 45 Computational Computational complexity advanced ,T-Introduction to Algorithms ,T- PPT,Simulati CO3

Complexity topics Introduction to the Design and,R- on,Video
Design & Analysis of Computer Lecture
,R-Fundamentals of Computer Algor

Lecture Plan Preview-Practical

Mapped with CO
Unit No ExperimentNo Experiment Name Text/ Reference Books Pedagogical Tool**
Numer(s)
1 1 Implementation of ,T-Introduction to Algorithms ,R-Design PPT,Video Lecture CO3,CO4
Binary Search using & Analysis of Computer
the Divide & Conquer
Approach.
1 2 Implementation of ,T-Introduction to Algorithms ,T- PPT,Simulation,Vid CO2,CO3
Quick Sort using Introduction to the Design and,R-Design eo Lecture
Divide & Conquer & Analysis of Computer
Approach.

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

1 3 Implement Strassen ,T-Introduction to Algorithms ,T- PPT,Simulation,Vid CO3,CO5

Matrix Multiplication Introduction to the Design and,R-Design eo Lecture
using Divide & & Analysis of Computer
Conquer Approach.
2 4 Find out the Minimum T-Introduction to Algorithms ,T-Introduction Simulation,Video CO2,CO4
Cost Spanning Tree to the Design and Lecture
using Kruskal’s
Algorithm with the
help of the Greedy
Approach.
2 5 Perform Job T-Introduction to Algorithms ,T-Introduction Simulation,Video CO3,CO4,CO5
Sequencing with a to the Design and Lecture
deadline using the
Greedy Approach.
2 6 Implement Travelling ,T-Introduction to Algorithms ,R-Design PPT,Simulation,Vid CO1,CO4
Salesman Problem & Analysis of Computer ,R- eo Lecture
(TSP) using Dynamic Fundamentals of Computer Algor
Programming.
2 7 Perform Matrix Chain ,T-Introduction to Algorithms ,T- PPT,Simulation,Vid CO2,CO4
Multiplication Problem Introduction to the Design and,R-Design eo Lecture
(MCM) using Dynamic & Analysis of Computer ,R-
Programming. Fundamentals of Computer Algor
3 8 Implement Graph ,T-Introduction to Algorithms ,T- PPT,Video Lecture CO4,CO5
Coloring Problem with Introduction to the Design and,R-Design
Backtracking & Analysis of Computer ,R-
Approach. Fundamentals of Computer Algor
3 9 Program to implement ,T-Introduction to Algorithms ,T- PPT,Simulation,Vid CO3,CO5
4-Queen Problem Introduction to the Design and,R-Design eo Lecture
using Backtracking & Analysis of Computer ,R-
Method Fundamentals of Computer Algor
3 10 10 Program to ,T-Introduction to Algorithms ,T- PPT,Simulation,Vid CO3,CO5
implement 0/1 Introduction to the Design and,R-Design eo Lecture
Knapsack Problem & Analysis of Computer
using Branch & Bound
Method. CO3, CO5

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 Hybrid Course All Practical Evaluations 40
2 Hybrid Course All End Term Hybrid Theory 60
3 Hybrid Course All Attendance Marks 2
4 Hybrid Course All Surprise Test 12
5 Hybrid Course All Practical MST 10
6 Hybrid Course All Practical 30
Worksheet/Projects 1
7 Hybrid Course All Practical 30
Worksheet/Projects 2
8 Hybrid Course All Practical 30
Worksheet/Projects 3
9 Hybrid Course All Practical 30
Worksheet/Projects 4
10 Hybrid Course All Practical 30
Worksheet/Projects 5
11 Hybrid Course All Practical 30
Worksheet/Projects 6

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

 Printed on 12/24/2024 6:28:11 PM
LECTURE PLAN

12 Hybrid Course All Practical 30

Worksheet/Projects 7
13 Hybrid Course All Practical 30
Worksheet/Projects 8
14 Hybrid Course All Practical 30
Worksheet/Projects 9
15 Hybrid Course All Practical 30
Worksheet/Projects 10
16 Hybrid Course All Quiz 4
17 Hybrid Course All Assignment/PBL 10
18 Hybrid Course All MST-1 Hybrid 20
19 Hybrid Course All MST-2 Hybrid 20

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