Analysis of Algorithm course is created to discover its features in order to evaluate its appropriateness for various applications or compare it with other algorithms for the same application. AOA is used for complete analysis of the running time of an Algorithm and mainly concerned with comparing algorithms based upon the amount of computing resources that each algorithm uses

Course Objectives:

1. To provide mathematical approaches for Analysis of Algorithms
2. To understand and solve problems using various algorithmic approaches
3. To analyze algorithms using various methods

Course Outcomes:

1. Analyze the running time and space complexity of algorithms.
2. Describe, apply and analyze the complexity of divide and conquer strategy.
3. Describe, apply and analyze the complexity of greedy strategy.
4. Describe, apply and analyze the complexity of dynamic programming strategy
5. Explain and apply backtracking, branch and bound.
6. Explain and apply string matching techniques.

Pre-requisite of this course: Data Structures, Discrete Structures