Amrita School of Computing, Chennai

Course Delivery Plan

Course Code : Course Name 23CSE211 - DESIGN AND Program B.Tech – Computer Science and Engineering
ANALYSIS OF ALGORITHMS
L-T–P-C 3-0-2-4 Semester / Year IV/II
Name(s) of the Faculty Dr R Annamalai, Dr. J Pre-requisite Data Structures and Algorithms, Discrete
Umamageswaran, Dr.K Ashwini Mathematics
Course Mentor Dr. K Ashwini Academic Year 2024-25
Course Overview This course aims to provide the fundamentals of algorithm design and analysis, specifically in terms of
algorithm design techniques, application of these design techniques for real-world problem solving and analysis
of complexity and correctness of algorithms.

Course Objectives Course Outcomes

This course aims to provide the fundamentals of algorithm design CO1 Evaluate the correctness and analyze complexity of algorithms.
and analysis, specifically in terms of algorithm design techniques, CO2 Implement various algorithmic design techniques and solve
application of these design techniques for real-world problem classical problems
solving and analysis of complexity and correctness of algorithms. CO3 Design solutions for real world problems by identifying, applying and
implementing appropriate design techniques.
CO4 Design solutions for real world problem by mapping to classical problems
CO5 Analyze the impact of various implementation choices on the algorithm
complexity

1
Syllabus
Unit 1
Introduction and Review-Review of Asymptotic notation: motivation and types of notations. Recurrence relations and methods to solve them:
Recursion tree, substitution, Master Method. Review of Sorting: Bubble –Insertion – Selection – Bucket – Heap, Comparison of sorting algorithms,
Applications. Graph Algorithms – Graph Traversal: Applications of BFS: distance, connectivity and connected components and cycles in undirected
graphs. Applications of DFS: Topological sort, cycles in directed graphs, Biconnected Components and Strong Connectivity. Path algorithms:
shortest path algorithms (along with analysis) SSSP: Bellman Ford. APSP: Floyd Warshall's. Review of Minimum Spanning Tree (with analysis
and applications).

Unit 2
Divide and Conquer: Merge sort, Quick Sort, Quick Select and Binary search type strategies, Pivot based strategies – Long integer multiplication
– Maximum sub array sum - Closest Pair problem, convex hull etc. as examples. Greedy Algorithm - Introduction, Fractional Knapsack problem,
Task Scheduling Problem, Huffman coding etc as examples. Dynamic Programming: Introduction, Fibonacci numbers, 0-1 Knapsack problem,
Matrix chain multiplication problem, Longest Common Subsequence, Optimal Binary search Tree and other problems including problems
incorporating combinatorics as examples.

Unit 3
Backtracking, Branch and Bound 0-1 Knapsack, N- Queen problem, subset sum as some examples. String Matching: Rabin Karp, Boyer Moore,
KMP. Network Flow and Matching: Flow Algorithms Maximum Flow – Cuts Maximum Bipartite Matching. Introduction to NP class: Definitions
P, NP, SAT problem NP complete, NP hard, Examples of P and NP. Scalable algorithms: Blind search, heuristic searching algorithms, hill
climbing algorithm, gradient descent algorithm, Parallel algorithms

Textbook(s)
T1: Michael T Goodrich and Roberto Tamassia, “Algorithm Design and Applications ”, John Wiley & Sons Inc, 2014
T2: Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein, “Introduction to Algorithms”, Fourth Edition, Prentice Hall of
India Private Limited, 2022

Reference(s)
R1: Dasgupta S, Papadimitriou C and Vazirani U, “Algorithms”, Tata McGraw-Hill, 2009
R2: Jon Kleinberg, Eva Tardos. “Algorithm Design”. First Edition, Pearson Education India; 2013
R3: McConnell, J. J. “Analysis of Algorithms: An Active Learning Approach”, 2nd edn. Jones & Bartlett Learning, 2001
R4: Russell, Stuart J. “Artificial intelligence a modern approach”. Pearson Education, Inc., 2010

2
Concept Map

3
 Evaluation and Grading

Internal External (30) Total

(70)

Components Marks Total

Marks
Periodicals Mid term
20
20
Continuous End Semester = Internal + External = 100
Assessment Theory Quiz (3) 10 10 30
(CAT)
Activity Sheet – 5 Sheets
5
(Coding questions from
Continuous online platform)
Assessment
Lab(CAL) Lab Evaluation (1 and 2)
15
40
Capstone Project
5
End Sem Lab Evaluation
10
Class room participation
5
Programme Outcome (PO)

PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering
specialization to the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, research literature, and analyze complex engineering problems reaching substantiated
conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PO3 Design/development of solutions: 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 Conduct investigations of complex problems: 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.

4
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools
including prediction and modeling to complex engineering activities with an understanding of the limitations.
PO6 The engineer and society: 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 Environment and sustainability: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the 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.
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.
PSO1 Ability to design and engineer, innovative, optimal and elegant computing solutions to interdisciplinary problems using
standard practices, tools and technologies.
PSO2 Ability to learn emerging computing paradigms for research and innovation

CO – PO Affinity Map
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO 1 3 3 1 1 1 1 1 3 2
CO 2 3 2 2 0 1 1 3 2
CO 3 3 2 3 2 0 1 1 3 2
CO 4 2 2 3 2 1 1 1 3 2
CO 5 2 2 3 1 1 1 1 3 2

5
3 – Strong, 2 Moderate, 1 -weak
Threshold (%) Percentage of Students
Target
(%) Level Level Level
1 2 3
50% 55% 50% 60% 70%

Mode of In-Class Out- Class Activities CO

Class Topics to be covered Reference
Teaching Activities (E – Ref.) Mapping

UNIT I
Introduction and Review- Self- https://ocw.mit.edu/courses/6-006-introduction-
Algorithms vs. programs. Flow Smart Board Assessment to-algorithms-spring-2020/resources/lecture-1-
1(L) CO1 T1,R1
charts and pseudo code and PPT Questions; algorithms-and-computation/
Discussions
Rate of growth of functions. Smart Board Self- T1,R1
Basic complexity analysis – and PPT Assessment http://www.iiitdm.ac.in/old/Faculty_Teaching/S
2(L) Questions; adagopan/pdf/ADSA/average-analysis.pdf CO1
Best, Worst, and Average
Cases Discussions
Smart Board Self- T1,R1
https://runestone.academy/ns/books/published/p
Review of Asymptotic and PPT Assessment
3(L) ythonds/AlgorithmAnalysis/BigONotation.html CO1
notation Types of notations Questions;
Discussions
Smart Board Self- T1,R1
http://iiitdm.ac.in/old/Faculty_Teaching/Sadago
Recurrence relations and and PPT Assessment
4(L) pan/pdf/DAA/new/recurrence-relations-V3.pdf CO1
methods Questions;
Discussions
Smart Board Self- T1,R1
https://cse.iitkgp.ac.in/~bivasm/pds_notes/recurs
and PPT Assessment
5(L) Recursion tree Method ion.pdf CO1
Questions;
Discussions
Smart Board Self- T1,R1
http://www.iiitdm.ac.in/old/Faculty_Teaching/S
and PPT Assessment
6(L) Substitution method adagopan/pdf/DAA/recurrence-relations-V3.pdf CO1
Questions;
Discussions
6
 Smart Board Self- T1,R1
http://iiitdm.ac.in/old/Faculty_Teaching/Sadago
and PPT Assessment
7(L) Master Method pan/pdf/DAA/new/recurrence-relations-V3.pdf CO1
Questions;
Discussions
Smart Board Self- T1,R1,R2,
http://iiitdm.ac.in/old/Faculty_Teaching/Sadago
and PPT Assessment R3
8(L) Bubble –Insertion pan/pdf/DAA/new/SortingAlgorithms.pdf CO2
Questions;
Discussions
Smart Board Self- T1,R1,R2,
Implementation of Bubble http://iiitdm.ac.in/old/Faculty_Teaching/Sadago
and PPT Assessment R3
9-10(P) Sort, Insertion sort with its pan/pdf/DAA/new/SortingAlgorithms.pdf CO2
Questions;
analysis
Discussions
Smart Board Self- T1,R1,R2,
https://ds2-iiith.vlabs.ac.in/exp/selection-
and PPT Assessment R3
11(L) Selection – Bucket sort/index.html CO1
Questions;
Discussions
Smart Board Self- T1,R1
Implementation of Selection https://cse.iitkgp.ac.in/~ppd/course/pds/Lect-25-
and PPT Assessment
12-13(P) Sort, Bucket sort with its 26-Sorting.pdf CO2
Questions;
analysis
Discussions
Smart Board Self- T1,R1,R2,
http://www.facweb.iitkgp.ac.in/~sourav/Lecture-
Heap, Comparison of sorting and PPT Assessment R3
14(L) 04.1.pdf CO1
algorithms Questions;
Discussions
Smart Board Self- T1,R1,R2,
http://www.facweb.iitkgp.ac.in/~sourav/Lecture-
Implementation of Heap Sort and PPT Assessment R3
15-16(P) 04.1.pdf CO3
with its analysis Questions;
Discussions
Smart Board Self- T1,R1,R2,
https://www.cse.iitd.ac.in/~mausam/courses/col
Applications of Sorting and PPT Assessment R3
17(L) 106/autumn2017/lectures/12-sorting.pdf CO3
Algorithm Questions;
Discussions
Smart Board Self- https://cse.iitrpr.ac.in/mukesh/CSL201- T1,R1,R2,
Graph Traversal: Applications
and PPT Assessment 1718/L21-Graphs-clean.pptx R3
of BFS: distance, connectivity
18(L) Questions; http://iiitdm.ac.in/old/Faculty_Teaching/Sadago CO3
and connected components and
Discussions pan/pdf/DAA/new/graphalgorithms.pdf
cycles in undirected graphs

7
 Smart Board Self- T1,R1,R2,
https://cse.iitrpr.ac.in/mukesh/CSL201-
BFS Implementation with and PPT Assessment R3
19-20(P) 1718/L21-Graphs-clean.pptx CO1
analysis Questions;
Discussions
Applications of DFS: Smart Board Self- T1,R1,R2,
Topological sort, cycles in and PPT Assessment https://web.iitd.ac.in/~bspanda/biconnectedMTL R3
21(L) directed graphs, Biconnected Questions; 776.pdf CO3
Components and Strong Discussions
Connectivity.
Smart Board Self- T1,R1,R2,
https://web.iitd.ac.in/~bspanda/biconnectedMTL
DFS Implementation with and PPT Assessment R3
22-23(P) 776.pdf CO1
analysis Questions;
Discussions
Smart Board Self- T1,R1,R2,
Path algorithms: Shortest path https://www.iitg.ac.in/psm/indexing_ma252/y12
and PPT Assessment R3
24(L) algorithms (along with /LectureNoteMA252Mar27.pdf CO3
Questions;
analysis) SSSP: Bellman Ford
Discussions
Smart Board Self- T1,R1,R2,
Implementation of Bellman https://www.iitg.ac.in/psm/indexing_ma252/y12
and PPT Assessment R3
25-26(P) Ford algorithm along with /LectureNoteMA252Mar27.pdf CO3
Questions;
analysis
Discussions
Smart Board Self- T1,R1,R2,
http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment R3
27,28(L) APSP: Floyd Warshall’s o1/Spring2020/Graphs-VI-Slide.pdf CO3
Questions;
Discussions
Smart Board Self- T1,R1,R2,
Implementation of Floyd http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment R3
29-30(P) Warshall algorithm along with o1/Spring2020/Graphs-VI-Slide.pdf CO3
Questions;
analysis
Discussions
Smart Board Self- T1,R1
Review of Minimum Spanning http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment
31-33(L) Tree (with analysis and o1/Spring2020/Graphs-IV-Slide.pdf CO4
Questions;
applications).
Discussions
QUIZ I
UNIT II

8
 Smart Board Self- T1,R1
Divide and Conquer: Merge https://www.andrew.cmu.edu/user/nbier/15110/l
and PPT Assessment
34(L) sort and Binary search type ectures/lec10_bin-search_mrg-srt.pdf CO4
Questions;
strategies
Discussions
Smart Board Self- T1,R1
Implementation of Merge sort, https://www.andrew.cmu.edu/user/nbier/15110/l
and PPT Assessment
35-38(P) Linear and Binary search ectures/lec10_bin-search_mrg-srt.pdf CO4
Questions;
along with the analysis
Discussions
Smart Board Self- T1,R1
Pivot based strategies – Long https://cse.iitkgp.ac.in/~debdeep/courses_iitkgp/
and PPT Assessment
39(L) integer multiplication – FOC/slidespdf/Mastertheorem.pdf CO4
Questions;
Maximum sub array sum
Discussions
Smart Board Self- T1,R1
https://www.cdeep.iitb.ac.in/slides/A14/EE717/
Implementation of Strassen and PPT Assessment
40(L) EE717-L15.pdf CO2
Matrix multiplication Questions;
Discussions
Smart Board Self- T1,R1
https://www.cse.iitd.ac.in/~rjaiswal/2011/csl356
and PPT Assessment
41(L) Closest Pair problem /Notes/Week-4/lec-1.pdf CO2
Questions;
Discussions
Smart Board Self- T1,R1
https://cse.iitkgp.ac.in/~abhij/course/lab/Algo1/S
Greedy Algorithm - and PPT Assessment
42(L) pring20/A4.pdf CO2
Introduction to the method, Questions;
Discussions
Smart Board Self- T2,R1
http://www.iiitdm.ac.in/old/Faculty_Teaching/S
and PPT Assessment
43(L) Fractional Knapsack problem adagopan/pdf/DAA/greedy.pdf CO2
Questions;
Discussions
Smart Board Self- T2,R1
Implementation of Fractional http://www.iiitdm.ac.in/old/Faculty_Teaching/S
and PPT Assessment
44-47(P) Knapsack problem using adagopan/pdf/DAA/greedy.pdf CO2
Questions;
Greedy algorithm
Discussions
Smart Board Self- T2,R1
http://iiitdm.ac.in/old/Faculty_Teaching/Sadago
and PPT Assessment
48(L) Task Scheduling Problem pan/pdf/ADSA/new/greedy-part-2.pdf CO2
Questions;
Discussions

9
 Smart Board Self- T1,R1
https://www.cse.iitd.ac.in/~rjaiswal/2014/csl356
and PPT Assessment
49(L) Huffman coding /Notes/Week-04/lec-02.pdf CO2
Questions;
Discussions
Implementation of Task/Job Smart Board Self- T1,R1
http://iiitdm.ac.in/old/Faculty_Teaching/Sadago
Scheduling Problem using and PPT Assessment
50-53(P) pan/pdf/ADSA/new/greedy-part-2.pdf CO2
Greedy algorithm and Questions;
Huffman Coding Discussions
Smart Board Self- https://www.sanfoundry.com/dynamic- T1,R1
Dynamic Programming:
and PPT Assessment programming-solutions-finonacci-numbers-
54(L) Introduction to the method, CO2
Questions; problem/
Fibonacci numbers
Discussions
Self- T1,R1
https://www.iitg.ac.in/psm/indexing_ma353/y09
Smart Board Assessment
55(L) 0-1 Knapsack problem /LectureNoteMA515Oct9.pdf CO4
and PPT Questions;
Discussions
Implementation of Fibonacci Smart Board Self- T1,R1
https://www.iitg.ac.in/psm/indexing_ma353/y09
numbers and 0-1 Knapsack and PPT Assessment
56-59(P) /LectureNoteMA515Oct9.pdf CO4
Problem using Dynamic Questions;
programming Discussions
Smart Board Self- T1,R2
https://www.simplilearn.com/tutorials/data-
Matrix chain multiplication and PPT Assessment
60(L) structure-tutorial/matrix-chain-multiplication CO4
problem Questions;
Discussions
Smart Board Self- T1,R2
https://www.cse.iitd.ac.in/~rjaiswal/2017/COL1
Longest Common and PPT Assessment
61(L) 06/Slides/Week-14/lec-1.pdf CO1
Subsequence Questions;
Discussions
Quiz II
UNIT – III
Smart Board Self-
https://cse.iitkgp.ac.in/~abhij/course/theory/Algo
and PPT Assessment
62(L) Backtracking 2/Autumn20/slides/Branch-and-Bound.pdf CO4 T1,R3
Questions;
Discussions

10
 Smart Board Self- T1,R1
https://cse.iitkgp.ac.in/~abhij/course/theory/Algo
Branch and Bound 0-1 and PPT Assessment
63(L) 2/Autumn20/slides/Branch-and-Bound.pdf CO4
Knapsack Questions;
Discussions
Smart Board Self- T1,R3
Implementation of 0-1 https://cse.iitkgp.ac.in/~abhij/course/theory/Algo
and PPT Assessment
64-66(P) Knapsack Problem using 2/Autumn20/slides/Branch-and-Bound.pdf CO5
Branch and Bound techhnique Questions;
Discussions
Smart Board Self- T1,R1
https://www.geeksforgeeks.org/n-queen-
and PPT Assessment
67(L) N- Queen problem problem-using-branch-and-bound/ CO3
Questions;
Discussions
Smart Board Self- T1,R1
http://cse.iitkgp.ac.in/~skolay/TOC/NPC-
and PPT Assessment
68(L) Subset sum examples.pdf CO4
Questions;
Discussions
Smart Board Self- T1,R1
http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment
69(L) String Matching: Rabin Karp o1/Spring2020/StringMatching-Slide.pdf CO5
Questions;
Discussions
Smart Board Self- T1,R1
http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment
70(L) Boyer Moore o1/Spring2020/StringMatching-Slide.pdf CO5
Questions;
Discussions
Smart Board Self- T1,R1
http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment
71(L) KMP o1/Spring2020/StringMatching-Slide.pdf CO5
Questions;
Discussions
Smart Board Self- T1,R1
Implementation of String http://cse.iitkgp.ac.in/~aritrah/course/theory/Alg
and PPT Assessment
72(L) Matching Algorithm: Rabin o1/Spring2020/StringMatching-Slide.pdf CO5
Questions;
Karp, Boyer Moore, KMP
Discussions

11
 Smart Board Self- T2,R4
https://cse.iitkgp.ac.in/~abhij/course/theory/Algo
Network Flow and Matching: and PPT Assessment
73(L) 2/Autumn20/slides/4-NetworkFlow.pdf CO5
Flow Algorithms Questions;
Discussions
Smart Board Self- T2,R4
https://www.cs.princeton.edu/~wayne/kleinberg-
Maximum Flow, Cuts and PPT Assessment
74(L) tardos/pdf/07NetworkFlowI.pdf CO5
Maximum Bipartite Matching Questions;
Discussions
Smart Board Self- T2,R3
Definitions P, NP, NP https://cse.iitkgp.ac.in/~goutam/toc/lect/P_NP_C
and PPT Assessment
75(L) complete, NP Hard and oNP.pdf CO5
Questions;
Examples of P&NP
Discussions
76(L) Scalable algorithms: Blind Smart Board Self- T2,R2
https://www.youtube.com/watch?v=CnqMV_wXc CO4
search, heuristic searching and PPT Assessment
Bg
algorithms Questions;
Discussions
77(L) Hill climbing algorithm, Smart Board Self- T2,R2
https://www.youtube.com/watch?v=3SiWtAnUR CO4
gradient descent algorithm and PPT Assessment
Os
Questions;
Discussions
78(L) Parallel algorithms Smart Board Self- T2,R2
https://www.youtube.com/watch?v=MBGV8rQlg CO4
and PPT Assessment
6Y
Questions;
Discussions
QUIZ III

NOTE:
(i) All students must maintain a minimum of 75% attendance in each course. This requirement is crucial for academic success and eligibility to appear for mid-term and
end-semester examinations.
(ii) Students who fail to meet the 75% attendance threshold will not be permitted to appear for the mid-term and end-semester exams. Requests for exceptions will not be
considered under any circumstances.
(iii) Attendance will be calculated up to three days prior to the commencement of the mid-term and end-semester exams, as per the academic calendar.

Faculty Course Mentor Chairperson/ Program Head

12