Course
Course Code Name of Course L T P Credit
Type
DC4 CSC206 Algorithm Design and Analysis 3 0 0 9
Course Objective
To provide fundamental knowledge about algorithms, algorithm paradigms, and measurement of space and time
complexity.
Learning Outcomes
Enhance the ability to understand different algorithm design paradigms and their respective space and time complexity
analysis.
Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction: Notions of Algorithms, Algorithm Understanding of algorithm design
Paradigms, Complexity Analysis, Asymptotic techniques, validation of algorithms, and
1 6
Notations, Practical Complexities. space and time complexity measurement of
algorithms.
Divide-and Conquer Paradigm: Recurrence To understand fundamentals of divide-
2 Relations, Order Statistics, Strassen's Matrix 6 andconquer strategy.
Multiplication.
Greedy Algorithms: Knapsack Problem, Tree Vertex Understanding of different problems solved
Splitting, Job Sequencing with Deadlines, Activity by greedy method.
3 Selection Problem, Minimum Cost Spanning Trees, 8
Optimal Storage on Tapes, Optimal Merge Patterns,
Single-Source Shortest Paths.
Dynamic Programming: Multistage Graphs, Matrix Understanding of different problems solved
4 7
Chain Multiplication, Single-Source and All-Pairs by dynamic programming.
Shortest Paths, Traveling Salesperson Problem,
Longest Common Subsequence.
Back Tracking: 8-Queens Problem, Graph Coloring, To understand fundamentals of back
5 5
Hamiltonian Cycles. tracking technique.
Branch-and-Bound: Least Cost Search, 15-Puzzle Understanding of different problems solved
6 3
Problem. by branch-and-bound technique.
NP-Hard and NP Complete Problems, Introduction to To understand the basic principles of
7 Approximation Algorithms. 4 deterministic and non-deterministic
algorithms.
Text Books:
1. Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, Prentice Hall of India.
2. E. Horowitz, S. Sahni, and S. Rajasekaran, Fundamentals of Computer Algorithms, Universities
Press.
Reference Books:
1. J. Kleinberg and E. Tardos, Algorithm Design, Pearson Education.
2. M. T. Goodrich and R. Tamassia, Algorithm Design, Wiley Student Edition.
3. S. Dasgupta, C. Papadimitriou, and U. Vazirani, Algorithms, McGraw Hill Education (India) Pvt.
Ltd.
