Design and Analysis of Algorithms

Course content

Introduction to algorithms. The computational complexity of algorithms. Amortized analysis. Lower and upper bound theory. Approaches for designing algorithms: Divide-and-Conquer, Greedy Approach, Dynamic Programming, Backtracking and Branch-and-Bound. NP-Complete and NP-Hard problems. Approximation algorithms.