SYLLABUS

CS8451 DESIGN AND ANALYSIS OF ALGORITHM

OBJECTIVES:
 To understand and apply the algorithm analysis techniques.
 To critically analyze the efficiency of alternative algorithmic solutions for the same
problem
 To understand different algorithm design techniques.
 To understand the limitations of Algorithmic power.
UNIT I INTRODUCTION 9
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important
Problem Types – Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic
Notations and their properties. Analysis Framework – Empirical analysis - Mathematical
analysis for Recursive and Non-recursive algorithms - Visualization
UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9
Brute Force – Computing an – String Matching - Closest-Pair and Convex-Hull Problems -
Exhaustive Search - Travelling Salesman Problem - Knapsack Problem - Assignment
problem.Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort –
Heap Sort - Multiplication of Large Integers – Closest-Pair and Convex - Hull Problems.
UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9
Dynamic programming – Principle of optimality - Coin changing problem, Computing a
Binomial Coefficient – Floyd‘s algorithm – Multi stage graph - Optimal Binary Search Trees
– Knapsack Problem and Memory functions. Greedy Technique – Container loading problem
- Prim‘s algorithm and Kruskal's Algorithm – 0/1Knapsack problem, Optimal Merge pattern -
Huffman Trees.
UNIT IV ITERATIVE IMPROVEMENT 9
The Simplex Method - The Maximum-Flow Problem – Maximum Matching in Bipartite
Graphs, Stable marriage Problem.
UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER 9
Lower - Bound Arguments - P, NP NP- Complete and NP Hard Problems. Backtracking – n-
Queen problem - Hamiltonian Circuit Problem – Subset Sum Problem. Branch and Bound –
LIFO Search and FIFO search - Assignment problem – Knapsack Problem – Travelling
Salesman Problem - Approximation Algorithms for NP-Hard Problems – Travelling
Salesman problem – Knapsack problem.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Design algorithms for various computing problems.
 Analyze the time and space complexity of algorithms.
 Critically analyze the different algorithm design techniques for a given problem.
 Modify existing algorithms to improve efficiency.
TEXT BOOKS:
1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, Third Edition,
Pearson Education, 2012.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++,
Second Edition, Universities Press, 2007.
REFERENCES:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein,
―Introductionto 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. Harsh Bhasin, ―Algorithms Design and Analysis‖, Oxford university press, 2016.
4. S. Sridhar, ―Design and Analysis of Algorithms‖, Oxford university press, 2014.
5. http://nptel.ac.in/

PERI Institute of Technology

 Mannivakkam, Chennai - 600048
Department of Computer Science and Engineering
Course File History
Department : CSE
Year :II YEAR-B SEC
Course Name : B.E. (R2017)
Subject Name :DESIGN AND ANALYSIS OF ALGORITHMS
Subject Code : CS8451
Faculty Name :Mr.A.Vijayanarayanan
Year of Establishment (Course) : 2021 – 2022
Course Plan B SEC
Content delivery methods:
 Lecture interspersed with discussion (chalk and board)
 Presentation slides (PPT)
Assessment methods:
 Internal Assessment test
 Assignments (Problems, Seminars)
Proposed Actual
S. No Topic to be Covered Teaching Reference Remarks
Date Date Method Material
UNIT I INTRODUCTION
1. Notion of an Algorithm 07.03.22 BB T1
07.03.22
Fundamentals of BB
2. Algorithmic Problem 08.03.22 09.03.22 T1
Solving

3. Important Problem Types 09.03.22 10.03.22 BB T1

Fundamentals of the BB
4. Analysis of Algorithmic 10.03.22 11.03.22 T1
Efficiency
5. Asymptotic Notations and 11.03.22 14.03.22 BB T1
their properties
BB T1
6. Analysis Framework 14.03.22 15.03.22

7. Empirical analysis 15.03.22 16.03.22 BB T1

8. Mathematical analysis for 16.03.22 17.03.22 PPT T1

Recursive and
 Non-recursive algorithms
9. Visualization 17.03.22 18.03.22 PPT T1

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER

Brute Force – Computing
10. an – String Matching 18.03.22 21.03.22 BB T1

11. Closest-Pair and Convex- 21.03.22 22.03.22 BB T1

Hull Problems
Exhaustive Search -
12. Travelling Salesman 22.03.22 23.03.22 BB T1
Problem
13. Knapsack Problem - 23.03.22 24.03.22 BB T1
Assignment problem
14. Divide and Conquer 24.03.22 25.03.22 BB T1
Methodology
15. Binary Search – Merge sort 25.03.22 28.03.22 BB T1

16. Quick sort – Heap Sort 28.03.22 29.03.22 BB T1

17. Multiplication of Large 29.03.22 30.03.22 BB T1

Integers
Closest-Pair and Convex -
18. Hull Problems. 30.03.22 BB T1 CAT 1 Exam
31.03.22

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE

Dynamic programming –
19. Principle of optimality 31.03.22 01.04.22 PPT T1

20. Coin changing problem 01.04.22 04.04.22 PPT T1

21. Computing a Binomial 04.04.22 05.04.22 PPT T1

Coefficient
22. Floyd‘s algorithm 05.04.22 06.04.22 BB T1

23. Multi stage graph 06.04.22 07.04.22 BB T1

24. Optimal Binary Search 07.04.22 08.04.22 BB T1

Trees
25. Knapsack Problem 08.04.22 11.04.22 BB T1

26. Container loading problem 11.04.22 12.04.22 BB T1

Prim‘s algorithm and 13.04.22

27. Kruskal's Algorithm 12.04.22 PPT T1

UNIT IV ITERATIVE IMPROVEMENT

 The Simplex Method BB/PPT T2
28. 13.04.22 18.04.22

29. The Simplex Method 18.04.22 19.04.22 BB/PPT T2

The Maximum-Flow
30. Problem BB/PPT T2
19.04.22 20.04.22

The Maximum-Flow
31. Problem BB/PPT T2
20.04.22 21.04.22

Maximum Matching in
32. Bipartite Graphs BB/PPT T2
21.04.22 22.04.22

Maximum Matching in
33. Bipartite Graphs BB/PPT T2
22.04.22 25.04.22

34. Stable marriage Problem BB/PPT T2

25.04.22 26.04.22
35. Stable marriage Problem BB/PPT T2
26.04.22 27.04.22
CAT II
36. Revision 28.04.22 BB/PPT T2
27.04.22 Exam

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER

37. Lower - Bound Arguments - 28.04.22 29.04.22

BB T3
P
38. NP NP- Complete and NP 29.04.22 02.05.22
BB T3
Hard Problems
39. Backtracking BB T3
02.05.22 03.05.22
40. n-Queen problem BB T3
03.05.22 04.05.22
Hamiltonian Circuit BB
41. Problem – Subset Sum T3
04.05.22 05.05.22
Problem
42. Branch and Bound BB T3
05.05.22 06.05.22
43. Assignment problem – 06.05.22 09.05.22
BB T3
Knapsack Problem
44. Travelling Salesman 09.05.22 10.05.22
BB T3
Problem
45. Approximation Algorithms 10.05.22 14.05.22
BB T3 Model Exam
for NP-Hard Problems

Subject in charge HOD