Dr. Lalatendu Behera
Vision and Mission of the Department and Institute
CS0501: Algorithm Design and Analysis
Instructor
Dr. Lalatendu Behera
TAs
Harshita Singh
Class Timings and Venue
Monday: 02:30 PM - 03:25 PM
Thursday: 03:30 PM - 04:25 PM
Friday: 04:30 PM - 05:25 PM
Venue: CS-201
Course Outcomes
| CO | |
| 1 | Recall and interpret fundamental data structures and complexity notations; analyze their performance in the context of algorithm design paradigms. |
| 2 | Construct and evaluate hierarchical and multimedia data structures to solve domain-specific problems efficiently. |
| 3 | Analyze and compare advanced data structures like heaps, disjoint sets, and graph-based algorithms for real-world applications. |
| 4 | Design and analyze advanced algorithms and classify problems into complexity classes using polynomial-time reductions to establish NP-completeness. |
CO - PO Mapping
| DSE | DSE | CSE (IS) | CSE (IS) | ||||
| CO | PO1 | PO2 | PO3 | PSO1 | PSO2 | PSO1 | PSO2 |
| CO1 | L | L | L | M | |||
| CO2 | M | M | L | H | |||
| CO3 | H | M | H | H | L | ||
| CO4 | H | H | H | M | |||
Recommended Books
Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022.
Kleinberg, Jon, and Eva Tardos. Algorithm design. Pearson Education India, 2006.
Goodrich, Michael T., and Roberto Tamassia. Algorithm design: foundations, analysis, and internet examples. John Wiley & Sons, 2001.
Evaluation
Class Performance: 5%
Assignments: 5%
Quiz: Three Quizzes (Best Two) (10%)
Mid-semester: 30%
End-semester: 50%
Syllabus
Recommended Materials
Classes
| Lecture No. | Date | Topic | Source |
| 1 | 25/08 | Introduction to the course |  |
| 2 | 26/08 | Introduction to Algorithms | |
| 3 | 01/09 | Upper Bound | |
| 4 | 03/09 | Lower and Tight Bound, Space Complexity | |
| 5 | 08/09 | Solving Recurrence Relation | |
| 6 | 09/09 | Merge Sort | |
| 7 | 10/09 | Quick Sort and Single Source Shortest Path Algorithm | |
| 8 | 15/09 | Correctness proof of Dijkstra Algorithm and Minimizing Maximum Lateness | |
| 9 | 16/09 | Correctness and Optimality proof of EDF Algorithm and Matrix Chain Multiplication | |
| 10 | 17/09 | Longest Common Subsequence | |
Homeworks
Quizzes
Practice Questions
To be declared