Design and Analysis of Algorithms

Overview

Overview - Framework for Algorithms Analysis - Asymptotic Notation - Algorithm Design Techniques:Basics - Divide And Conquer - Median Finding,Surfing Lower Bounds,Closest Pair - Greedy Algorithms - Pattern Matching -Combinational Search and Optimization - Dynamic Programming - Longest Common Sub sequences - Matric Chain Multiplication - Scheduling with Startup and Holding Costs - Bipartite Maximum Matching - Lower Bounds for Sorting - Element Distinctness Lower Bounds-NP - Completeness -Motivation - Approximation Algorithms - Approximation Algorithms for NP