IIT Bombay · Computer Science
Design and Analysis of Algorithms
Prof. Abhiram G Ranade, Prof. Ajit A Diwan, Prof. Sundar Viswanathan · 34 free video lectures
34 video lectures. Topics: Overview of the course; Framework for Algorithms Analysis; Algorithms Analysis Framework - II; Asymptotic Notations; Algorithm Design Techniques : Basics; Divide And Conquer-I; Divide And Conquer -II Median Finding; Divide And Conquer -III Surfing Lower Bounds; Divide And…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Overview of the course
- Framework for Algorithms Analysis
- Algorithms Analysis Framework - II
- Asymptotic Notations
- Algorithm Design Techniques : Basics
- Divide And Conquer-I
- Divide And Conquer -II Median Finding
- Divide And Conquer -III Surfing Lower Bounds
- Divide And Conquer -IV Closest Pair
- Greedy Algorithms -I
- Greedy Algorithms - II
- Greedy Algorithms - III
- Greedy Algorithms - IV
- Pattern Matching - I
- Pattern Matching - II
- Combinational Search and Optimization I
- Combinational Search and Optimization II
- Dynamic Programming
- Longest Common Subsequences
- Matrix Chain Multiplication
- Scheduling with Startup and Holding Costs
- Average case Analysis of Quicksort
- Bipartite Maximum Matching
- Lower Bounds for Sorting
- Element Distinctness Lower Bounds
- NP-Completeness-I -Motivation
- NP - Completeness - II
- NP-Completeness - III
- NP-Completeness - IV
- NP-Completeness - V
- NP-Completeness - VI
- Approximation Algorithms
- Approximation Algorithms
- Approximation Algorithms for NP
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Bombay.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights