Design and Analysis of Algorithms

IIT Bombay Course , Prof. Abhiram G Ranade

454 students enrolled

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

Lecture 18: Dynamic Programming

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        3.7 (13 Ratings)

        LECTURES



        Review


        3.7

        13 Rates
        5
        54%
        7
        3
        15%
        2
        2
        23%
        3
        1
        8%
        1

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment