MEENAKSHI COLLEGE OF ENGINEERING

West KK Nagar, Chennai – 600 078

LESSON PLAN
Name of the faculty: Department: IT

Code & Name of Subject: CS8451 - Design & Analysis of Algorithms Department: IT

Year / Semester: II / IV Unit: 1(INTRODUCTION) Hours as per syllabus: 9

Page 1of 5
Additional
resources for
Chapter
Sl. Topics to be covered / Tutorial to be Mode of Books to be referred reference like
Hour(s) Number /
No done/Content beyond the syllabus planned Teaching website
page number
/journals/
NPTEL lect
1 Introduction to Notion of an Algorithm 1 Hour Lecture TEXT BOOKS: 1-7
1. Anany Levitin, 9-16
Fundamentals of Algorithmic Problem Solving- http://nptel.ac.i
2 1 Hour Lecture “Introduction to the Design
Important Problem Types n/
and Analysis of
Fundamentals of the Analysis of Algorithm 17-22
3 1 Hour Lecture Algorithms”, Third Edition,
Efficiency- Analysis Framework
Pearson Education, 2012.
4 Asymptotic Notations and its properties 1 Hour Lecture 39

5 Empirical Analysis 1 Hour Lecture 40-48

6 Basic Efficiency Classes-Recurrence Equation 1 Hour Lecture 49-56

Mathematical analysis for Recursive algorithms. 65-72
7 1 Hour Lecture
Mathematical analysis for Non-recursive 57-63
8 algorithms. 1 Hour Lecture

9 Visualization 1Hour Lecture 63-72

10 Revision 1Hour Lecture PPT

Total hours as per Plan 10 Hours

Year / Semester: II / IV Unit : 2(BRUTE FORE AND DIVIDE AND CONQUER) Hours as per syllabus : 9

Page 2 of 5

Additional
Chapter resources for
Sl. Topics to be covered / Tutorial to be Mode of Books to be referred Number / reference like
Hour(s)
No done/Content beyond the syllabus planned Teaching page website
number /journals/
NPTEL lect
Brute Force –computing an Selection sort, 93-97
1 1 Hour Lecture
Bubble sort http://nptel.ac.in/
2 Sequential search, and String Matching 1 Hour Lecture 98-101

BruteForceTechnique-Closest-PairProblems and 102-106

3 1 Hour Lecture
Convex-Hull Problems
Exhaustive Search - Traveling Salesman TEXT BOOKS: 108-113
4 Problem - Knapsack Problem - Assignment 1 Hour Lecture 1. Anany Levitin,
problem “Introduction to the Design
Divide and conquer methodology – Binary and Analysis of 117-121
5 1 Hour Lecture
search Algorithms”, Third Edition,
6 Merge sort 1 Hour Lecture Pearson Education, 2012. 123-127

7 Quick sort, Heap sort 1 Hour Lecture 128-131

Multiplication of Large Integers - Strassen’s 137-141

8 1 Hour Lecture
Matrix Multiplication-
Divide and conquer methodology -Closest-Pair 142-146
9 1 Hour Lecture
and Convex-Hull Problems
10
**State-space search, Tower of Hanoi
1Hour Lecture PPT

Total hours as per Plan 10 Hours

 Unit : 3(DYNAMIC PROGRAMMING&
Year / Semester:II / IV GREEDY TECHNIQUE ) Hours as per syllabus : 9

Page 3 of 5

Additional
Chapter resources for
Topics to be covered / Tutorial to be
Sl. Mode of Books to be referred Number / reference like
done/Content beyond the syllabus Hour(s)
No Teaching page website
planned
number /journals/
NPTEL lect
Dynamic Programming – Introduction TEXT BOOKS: 265-268
1 -Computing a Binomial Coefficient 1 Hour Lecture 1. Anany Levitin, http://nptel.ac.in
Warshall’s algorithm “Introduction to the Design 270-273
2 1 Hour Lecture and Analysis of
Algorithms”, Third
Floyd’s algorithm Edition, Pearson 273-277
3 1 Hour Lecture
Education, 2012.
Optimal Binary Search Trees 278-282
4 1 Hour Lecture

Knapsack Problem and Memory functions 284-287

5 1 Hour Lecture

Greedy Technique– Prim’s algorithm 291-296

6 1 Hour Lecture

Kruskal's Algorithm 298-304

7 1 Hour Lecture

Dijkstra'sAlgorithm 305-309
8 1 Hour Lecture

Huffman Trees 311-314

9 1Hour Lecture

**Longest common subsequence ,Activity-Selection PPT

10 Problem 1Hour Lecture

Total hours as per Plan 10 Hours

Year / Semester: II / IV Unit : 4(ITERATIVE IMPROVEMENT) Hours as per syllabus : 9

Page 4 of 5
Additional
Chapter resources for
Sl. Topics to be covered / Tutorial to be Mode of Books to be referred Number / reference like
Hour(s)
No done/Content beyond the syllabus planned Teaching page website
number /journals/
NPTEL lect
The Simplex Method - Introduction TEXT BOOKS: 317
1 1 Hour Lecture
http://nptel.ac.in
The Simplex Method – Interpretation of Linear 1. Anany Levitin, 319-331
2 1 Hour Lecture
Programming “Introduction to the Design
The Maximum-Flow Problem - Introduction and Analysis of 333
3 1 Hour Lecture
Algorithms”, Third Edition,
The Maximum-Flow Problem - Algorithm Pearson Education, 2012. 333-343
4 1 Hour Lecture
The Max Flow Min Cut - Problems . 343-345
5 1 Hour Lecture
Maximum Matching in Bipartite Graphs - 345-349
6 1 Hour Lecture
Algorithm
Maximum Matching in Bipartite Graphs - 349-351
7 1 Hour Lecture
problems
Stable marriage Problem – Algorithm,Problems 353-355
8 1 Hour Lecture
PPT
9 **Multistage Graph 1Hour Lecture

Total hours as per Plan 9 Hours

 Unit : 5(COPING WITH THE LIMITATIONS OF
Year / Semester: II / IV ALGORITHM POWER) Hours as per syllabus : 9
Page 5 of 5

Additional
Chapter resources for
Sl. Topics to be covered / Tutorial to be Mode of Books to be referred Number / reference like
Hour(s)
No done/Content beyond the syllabus planned Teaching page website
number /journals/
NPTEL lect
Limitations of Algorithm Power-Lower-Bound TEXT BOOKS: 359-366
1 1 Hour Lecture
Arguments
Decision Trees 1. Anany Levitin, 366-372 http://nptel.ac.in
2 1 Hour Lecture
“Introduction to the Design
P, NP and NP-Complete Problems and Analysis of 372-380
3 1 Hour Lecture Algorithms”, Third Edition,
Coping with the Limitations - Backtracking – n- Pearson Education, 2012. 393-400
4 Queens problem- Hamiltonian Circuit Problem – 1 Hour Lecture
Subset Sum Problem
Branch and Bound – Assignment problem 402-405
5 1 Hour Lecture
Knapsack Problem- Traveling Salesman 405-409
6 1 Hour Lecture
Problem
Algorithms for NP – Hard Problems 411-413
7 1 Hour Lecture
Traveling Salesman problem 413-423
8 1 Hour Lecture
Knapsack problem 423-427
9 1Hour Lecture
PPT
10 **Verbal arithmetic ,Cutting stock problem 1Hour Lecture

Total hours as per Plan 10 Hours

:
TEXT BOOK:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012.

REFERENCES:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI Learning Private
Limited, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, Reprint 2006.
3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009. Steven S. Skiena, “The Algorithm Design
Manual”, Second Edition, Springer, 2008. 4. http://nptel.ac.in/

Prepared by
Reviewed by Approved by

Faculty: Mentor: HOD:

Date:
Date: Date:
Distribution