Analysis and Design of Algorithms

Major data structures design techniques - Divide and conquer – Dynamic programming - Heuristics - Parallel algorithms - Analysis of algorithms - Orders of magnitude - Lower bound theory - Time and space complexity - NP-hard and NPcomplete problems - Applications and examples - Correctness of algorithms -

Structure of algorithms.