Design and Analysis of Algorithms

IIT Bombay Course , Prof. Abhiram G Ranade

470 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 5: Algorithm Design Techniques Basics

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
        2.8 (19 Ratings)

        LECTURES



        Review


        2.8

        19 Rates
        5
        26%
        5
        4
        16%
        3
        3
        11%
        2
        2
        11%
        2
        1
        37%
        7

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