- Algorithm Specification
- Performance Analysis
- Randomized Algorithms
This course will delve into the realm of computer science. You will learn how to analyse an algorithm theoretically and mathematically to make it more optimized. The run time analysis and cost measurement will be taught.
You will study and implement various algorithmic strategies such as divide and conquer, greedy method, dynamic programming, backtracking, branch and bound and different string matching algorithms.
This course will give you a strong hold over estimating and solving computational problems and also give you an insight into making efficient algorithms.