x
Menu

Design and Analysis of Algorithms

IIT Bombay, , Prof. Abhiram G Ranade

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

Includes

Lecture 12: Greedy Algorithms - III

4.1 ( 11 )


Lecture Details

Ratings

4.0


7 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send