Lecture

Lecture - 1 Overview of the course
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 2 Framework for Algorithms Analysis
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 3 Algorithms Analysis Framework - II
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 4 Asymptotic Notation
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -5 Algorithm Design Techniques : Basics
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -6 Divide And Conquer-I
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -7 Divide And Conquer -II Median Finding
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -8 Divide And Conquer -III Surfing Lower Bounds
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -9 Divide And Conquer -IV Closest Pair
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -10 Greedy Algorithms -I
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 11 Greedy Algorithms - II
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 12 Greedy Algorithms - III
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 13 Greedy Algorithms - IV
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 14 Pattern Matching - I
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 15 Pattern Matching - II
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -16 Combinational Search and Optimization I
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 17 Combinational Search and Optimization II
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -18 Dynamic Programming
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture 19 Longest Common Subsequences
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -20 Matric Chain Multiplication
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 21 Scheduling with Startup and Holding Costs
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 22 Average case Analysis of Quicksort
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 23 Bipartite Maximum Matching
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 24 Lower Bounds for Sorting
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Playing
Lecture -25 Element Distinctness Lower Bounds
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture -26 NP-Completeness-I -Motivation
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 27 NP - Compliteness - II
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 28 NP-Completeness - III
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 29 NP-Completeness - IV
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 30 NP-Completeness - V
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 31 NP-Completeness - VI
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 32 Approximation Algorithms
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 33 Approximation Algorithms
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play
Lecture - 34 Approximation Algorithms for NP
Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade

Play

Lecture - 24 Lower Bounds for Sorting

Course Lectures