Algorithm Design Analysis

This course aims to teach you how to conduct complexity analysis of simple algorithms. It will further develop your knowledge and skills about algorithm design. You will learn to design algorithms using approaches like greedy and dynamic programming to solve various problems. For examples, shortest-path, minimum spanning tree, the longest common subsequence, 0/1 Knapsack problem. You will understand the concept and implementation of finite state machines and use regular expressions to specify sets of strings. You will also learn the concepts of complexity classes P & NP and apply greedy heuristic approach to solve NP-complete problems.