Printed on 8/5/2023 12:24:25 AM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering -

OF ENGINEERING (UIE) Computer Science & Engineering
(CS201)
Master Subject Coordinator Richa Dhiman Master Subject Coordinator E- E11307
Name: Code:
Course Name Design and Analysis of Course Code 21CSH-311
Algorithms with Lab

Lecture Tutorial Practical Self Study Credit Subject Type

3 0 2 0 4.0 T

Course Type Course Category Mode of Assessment Mode of Delivery

Major Core 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 dsfdsf dsfdsf dsf df ds fdsfdsf dsfds fdsfds dsfdsf ds fds

PO1 Engineering knowledge: Apply the knowledge of Mathematics, Science, Engineering fundamentals and computer science
fundamental and strategies which have the solution of complex computer science engineering problems.
PO2 Problem analysis: Identify, formulate, research literature, and analyse complex computer science engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex database and software engineering problems and design system
components or processes that meet the specified needs with appropriate considerations for the public health and safety, and the
cultural, societal, and environmental considerations.
PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods including design of software
engineering & networking-based experiments, analysis and Interpretation of data, and synthesis of the information to provide valid
conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern Computer science engineering and
IT tools including prediction and modelling to complex database or software engineering activities with an understanding of the
limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess.Social, health, safety, legal and
cultural issues and the consequent responsibilities relevant to the Professional Computer Science & Engineering practice.

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

 Printed on 8/5/2023 12:24:25 AM
LECTURE PLAN

PO7 Environment and sustainability: Understand the impact of the professional computer science and engineering solutions in social
and environmental contexts, and demonstrate the knowledge of, and need for sustainable development goals.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of computer science engineering
practice PO9: Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO10 Communication: 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 Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in
the broadest context of technological change.

Text Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Introduction to Algorithms Cormen, Leiserson, Rivest, 3rd PrenticeHallofIndia 2012
Stein
2 Fundamentals of Computer Horowitz, Sahni and 2ndedition University Press 2012
Algorithms Rajasekaran (India)

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Data Structures using C and C++ Tanenbaum, Augenstein 2nd Prentice Hall of 2000
India
2 Fundamental Algorithms Knuth Volume1 Addison- Wesley 1997

Course OutCome
SrNo OutCome
CO1 Apply the knowledge of efficiency evaluation of algorithm with respect to time and space complexity of
algorithms.
CO2 Describe the various algorithm development approaches to solve the problems like divide and conquer
,graph based ,tree based etc.
CO3 Apply the knowledge of algorithm design techniques to solve the problems of searching, sorting and
graph algorithms.
CO4 Evaluate the complexity of the algorithms to evaluate the efficiency and effectiveness as greedy
strategy, dynamic programming.
CO5 Analyze the various techniques for algorithm design and apply the knowledge to solve complex
engineering problems.

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 Algorithm and Designing and analyzing algorithms ,T-Introduction to Algorithms,R- Video CO1
Program Fundamental Algorithms Lecture
Performance
1 2 Algorithm and Time and Space complexity ,T-Introduction to Algorithms,R- Video CO1
Program Fundamental Algorithms Lecture
Performance

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

 Printed on 8/5/2023 12:24:25 AM
LECTURE PLAN

1 3 Algorithm and Average and worst case Analysis ,T-Introduction to Algorithms,R- PPT,Video CO1
Program Fundamental Algorithms Lecture
Performance
1 4 Algorithm and Asymptotic notations ,T-Introduction to Algorithms,R- PPT,Video CO1
Program Fundamental Algorithms Lecture
Performance
1 5 Algorithm and recurrence equations and their ,T-Fundamentals of Computer PPT,Video CO1
Program solution: substitution method Algor,T-Introduction to Lecture
Performance Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 6 Algorithm and recursion-tree method, master method ,T-Fundamentals of Computer PPT,Video CO1
Program Algor,T-Introduction to Lecture
Performance Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 7 Review of Data Arrays, Stacks, Queues ,T-Fundamentals of Computer PPT,Video CO1
Structures Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 8 Review of Data Pointers, Linked Lists (One –way, Two- ,T-Fundamentals of Computer PPT,Video CO1
Structures way and circular Two-way) Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 9 Review of Data Hashing, Trees - BST ,T-Fundamentals of Computer PPT,Video CO2
Structures Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 10 Review of Data B Tree, balanced trees (AVL, Red ,T-Fundamentals of Computer PPT,Video CO2
Structures black trees) Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 11 Review of Data Heaps, Graphs ,T-Fundamentals of Computer PPT,Video CO2
Structures Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 12 Sorting Sorting in linear time: counting sort ,T-Fundamentals of Computer PPT,Video CO2
Algorithm Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 13 Sorting radix sort ,T-Fundamentals of Computer PPT,Video CO2
Algorithm Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 14 Sorting bucket sort ,T-Fundamentals of Computer PPT,Video CO2
Algorithm Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
1 15 Sorting Revision of unit 1 ,T-Fundamentals of Computer PPT,Video CO2
Algorithm Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 16 Divide and Divide and conquer: The General ,T-Fundamentals of Computer PPT,Video CO2
Conquer & method, Binary search, Finding Algor,T-Introduction to Lecture
Greedy maximum and minimum of a sequence Algorithms,R-Data Structures using
Algorithms of numbers C and C+,R-Fundamental
Algorithms

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

 Printed on 8/5/2023 12:24:25 AM
LECTURE PLAN

2 17 Divide and 2 way Merge sort, Quick sort, Selection ,T-Fundamentals of Computer PPT,Video CO2
Conquer & sort, Strassen’s matrix multiplication. Algor,T-Introduction to Lecture
Greedy Algorithms,R-Data Structures using
Algorithms C and C+,R-Fundamental
Algorithms
2 18 Divide and Greedy algorithms: The general ,T-Fundamentals of Computer PPT,Video CO3
Conquer & method, Fractional Knapsack problem Algor,T-Introduction to Lecture
Greedy Algorithms,R-Data Structures using
Algorithms C and C+,R-Fundamental
Algorithms
2 19 Divide and Minimum cost spanning tree: Prim’s ,T-Fundamentals of Computer PPT,Video CO3
Conquer & Algorithm, Kruskal Algorithm Algor,T-Introduction to Lecture
Greedy Algorithms,R-Data Structures using
Algorithms C and C+,R-Fundamental
Algorithms
2 20 Divide and Huffman coding, Optimal merge ,T-Fundamentals of Computer PPT,Video CO3
Conquer & patterns Algor,T-Introduction to Lecture
Greedy Algorithms,R-Data Structures using
Algorithms C and C+,R-Fundamental
Algorithms
2 21 Dynamic The general method, 0/1 knapsack, ,T-Fundamentals of Computer PPT,Video CO3
Programming Subset Sum problem Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 22 Dynamic Change making problem, optimal binary ,T-Fundamentals of Computer PPT,Video CO3
Programming search tree, Matrix-chain Multiplication Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 23 Dynamic Longest common Subsequence ,T-Fundamentals of Computer PPT,Video CO3
Programming Problem, Travelling salesman problem Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 24 Dynamic Comparison of Divide & Conquer and ,T-Fundamentals of Computer PPT,Video CO3
Programming Dynamic Programming techniques. Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 25 BackTracking& Backtracking: The general method, N- ,T-Fundamentals of Computer PPT,Video CO3
Branch and queen’s problem Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 26 BackTracking& sum-of-subsets ,T-Fundamentals of Computer PPT,Video CO3
Branch and Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 27 BackTracking& Hamiltonian cycles. ,T-Fundamentals of Computer PPT,Video CO3
Branch and Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 28 BackTracking& Branch and Bound: Branch and Bound ,T-Fundamentals of Computer PPT,Video CO3
Branch and method, 0/1 Knapsack problem Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
2 29 BackTracking& Travelling salesperson problem. ,T-Fundamentals of Computer PPT,Video CO3
Branch and Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms

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

 Printed on 8/5/2023 12:24:25 AM
LECTURE PLAN

2 30 BackTracking& Revision of unit 2 ,T-Fundamentals of Computer PPT,Video CO3

Branch and Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 31 Graph Representation of Graphs, Depth First ,T-Fundamentals of Computer PPT,Video CO2
Algorithms Search, Breadth First search, Algor,T-Introduction to Lecture
Topological sort Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 32 Graph Single source shortest path: Dijkstra ,T-Fundamentals of Computer PPT,Video CO2
Algorithms Algorithm& Bellman Ford Algorithm Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 33 Graph All-pair shortest paths: Floyd Warshall ,T-Fundamentals of Computer PPT,Video CO2
Algorithms Algorithm, Minimum Spanning Tree: Algor,T-Introduction to Lecture
Sollin’salgorithm. Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 34 Computational Basic concepts, P and NP-classes ,T-Fundamentals of Computer PPT,Video CO4
Complexity Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 35 Computational proof of NP-hard and NP- ,T-Fundamentals of Computer PPT,Video CO4
Complexity completeness. Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 36 Miscellaneous Euclid Algorithm for GCD of 2 numbers ,T-Fundamentals of Computer PPT,Video CO1
Topics Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 37 Miscellaneous modulo arithmetic ,T-Fundamentals of Computer PPT,Video CO1
Topics Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 38 Miscellaneous Chinese remainder theorem ,T-Fundamentals of Computer PPT,Video CO5
Topics Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 39 Miscellaneous string manipulation/matching ,T-Fundamentals of Computer PPT,Video CO5
Topics algorithms: Rabin Karp algorithm Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 40 Miscellaneous KMP (Knuth-Morris-Pratt) algorithm ,T-Fundamentals of Computer PPT,Video CO5
Topics Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 41 Miscellaneous Boyer-Moore algorithm ,T-Fundamentals of Computer PPT,Video CO5
Topics Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 42 Miscellaneous Convex Hull ,T-Fundamentals of Computer PPT,Video CO5
Topics Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms

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

 Printed on 8/5/2023 12:24:25 AM
LECTURE PLAN

3 43 Divide and Doubt session: unit -1 ,T-Fundamentals of Computer PPT,Video CO2

Conquer & Algor,T-Introduction to Lecture
Greedy Algorithms,R-Data Structures using
Algorithms C and C+,R-Fundamental
Algorithms
3 44 BackTracking& Doubt session of unit -2 ,T-Fundamentals of Computer PPT,Video CO4
Branch and Algor,T-Introduction to Lecture
Bound Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms
3 45 Computational Doubt session unit-3 ,T-Fundamentals of Computer PPT,Video CO5
Complexity Algor,T-Introduction to Lecture
Algorithms,R-Data Structures using
C and C+,R-Fundamental
Algorithms

Lecture Plan Preview-Practical

Mapped with CO
Unit No ExperimentNo Experiment Name Text/ Reference Books Pedagogical Tool**
Numer(s)
1 1 Analyze if stack ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO2
Isempty, Isfull and if Introduction to Algorithms,R-Data
elements a Structures using C and C+,R-Fundamental
Algorithms
1 2 Develop a program ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO1
for implementation of Introduction to Algorithms,R-Data
power fun Structures using C and C+,R-Fundamental
Algorithms
1 3 Evaluate the ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO1
complexity of the Introduction to Algorithms,R-Data
developed program t Structures using C and C+,R-Fundamental
Algorithms
1 4 Apply the concept of ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO2
Linked list and write Introduction to Algorithms,R-Data
code to Structures using C and C+,R-Fundamental
Algorithms
2 5 Sort a given set of ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO3
elements using the Introduction to Algorithms,R-Data
Quick sort Structures using C and C+,R-Fundamental
Algorithms
2 6 Develop a program ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO4
and analyze Introduction to Algorithms,R-Data
complexity to imp Structures using C and C+,R-Fundamental
Algorithms
2 7 Develop a program ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO4
and analyze Introduction to Algorithms,R-Data
complexity to imp Structures using C and C+,R-Fundamental
Algorithms
3 8 Develop a program ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO2
and analyze Introduction to Algorithms,R-Data
complexity to do Structures using C and C+,R-Fundamental
Algorithms
3 9 Develop a program ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO2
and analyze Introduction to Algorithms,R-Data
complexity to fin Structures using C and C+,R-Fundamental
Algorithms
3 10 Develop a program ,T-Fundamentals of Computer Algor,T- PPT,Video Lecture CO5
and analyze Introduction to Algorithms,R-Data
complexity to fin Structures using C and C+,R-Fundamental
Algorithms

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

 Printed on 8/5/2023 12:24:25 AM
LECTURE PLAN

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 20EU01 External Theory 60
2 20EU01 Assignment 10
3 20EU01 Attendance Marks 2
4 20EU01 Mid-Semester Test-1 20
5 20EU01 Quiz 4
6 20EU01 Surprise Test 12
7 20EU01 Mid-Semester Test-2 20

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