मौलाना आजाद राष्ट्रीय प्रौद्योगिकी संस्थान, भोपाल- 462003

(शिक्षा मंत्रालय, भारत सरकार के तहत राष्ट्रीय महत्व का एक संस्थान)

MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY, BHOPAL- 462003
(An Institute of National importance under Ministry of Education, Govt. of India)

संगणक विज्ञान एवं अभियांत्रिकी विभाग

Department of Computer Science and Engineering

CSE 221 Algorithm Design & Analysis
Lecture Plan
S. No. Topics No of
Lectures
Unit I
1. Concepts Of Algorithm Analysis, space and time complexity, frequency count method, 2
comparison of complexities classes
2. Asymptotic Complexity 1
3. Example of analysis 1
4. Use of Recurrence relations in analysis of algorithm 1
5. Heaps and its operations and applications, Heap sort. 1
6. Disjoint Set Structure. 1
Unit II
7. Concept of Divide and Conquer , control abstraction for D&C. 1
8. Examples of problems using Divide and Conquer (Max-Min algorithm , Binary 2
Search) , Recurrence relation for D&C.
9. Merge Sort , Quick Sort , Selection Problem using D&C and their complexities 3
10. Matrix multiplication using D&C 2
Unit III
11. Greedy Method , Control Abstraction , Knapsack problem 1
12. Prim’s and Kruskal’s algorithm for minimum spanning trees using Greedy method 1

13. Single source shortest path algorithms and its applications. 1

14. Optimal merge pattern algorithms and its applications 1
15. Concept of Dynamic programming and 0/1 Knapsack problem 1
16. Multistage graph problem 1
17. Shortest path problem and traveling salesperson problem using dynamic programming 1

18. Reliability Design Problem 1

Unit IV
19. Basic Search techniques (DFS and BFS) 1
20. Concept of Backtracking , 8-queen’s problem 2
21. Hamiltonian cycle problem, Graph coloring problem etc using backtracking. 2
Concept of Branch and Bound 1
22. 15 puzzle using LC search 1
23. 0/1 knapsack, TSP problems using branch and bound 2
Unit V
24. Introduction to Lower Bound Theory 1
25. Concepts of NP-completeness, Example of NP, NP-Hard, NP-complete problems 2
 मौलाना आजाद राष्ट्रीय प्रौद्योगिकी संस्थान, भोपाल- 462003
(शिक्षा मंत्रालय, भारत सरकार के तहत राष्ट्रीय महत्व का एक संस्थान)
MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY, BHOPAL- 462003
(An Institute of National importance under Ministry of Education, Govt. of India)

Course Outcomes:
1. On successful completion of the course, students will be able to:
2. Analyze time and space complexity for the given algorithms.
3. Use various searching, sorting, and graph traversal algorithms.
4. Use various techniques for efficient algorithm design like divide and conquer greedy and dynamic
algorithms.
5. Describe minimum spanning tree algorithms, Single source shortest path, all pair shortest path
algorithms in a graph, and backtracking concepts.
6. Describe polynomial and non-polynomial problems; classify NP-hard and NP-complete problems
with their application.

List of Text Books:

1. Fundamentals of Computer Algorithms by Horowitz Ellis and Sartaj Sahni.
2. An Introduction to Algorithm by Thoman H. Cormen, Ronald L. Rivest.

विषय समन्वयक (Subject Coordinators)

डॉ. मानसी ज्ञानचंदानी ( Dr. Manasi Gyanchandani )
डॉ. मनीष पांडे ( Dr. Manish Pandey )
डॉ. श्वेता जैन ( Dr. Sweta Jain )