Design and Analysis of Algorithms
IIT Bombay, , Prof. Abhiram G Ranade
Added to favorite list
Updated On 02 Feb, 19
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
4.1 ( 11 )
Sep 12, 2018
Excellent course helped me understand topic that i couldn't while attendinfg my college.
March 29, 2019
Great course. Thank you very much.