Design and Analysis of Algorithms Tutorial

[Tony]

Video Tutorials on Design and Analysis of Algorithms

1 - Overview of the course


2 - Framework for Algorithms Analysis


3 - Algorithms Analysis Framework - II


4 - Asymptotic Notations


5 - Algorithm Design Techniques : Basics


6 - Divide And Conquer-I


7 - Divide And Conquer -II Median Finding


8 - Divide And Conquer -III Surfing Lower Bounds


9 - Divide And Conquer -IV Closest Pair


10 - Greedy Algorithms -I


11 - Greedy Algorithms - II


12 - Greedy Algorithms - III


13 - Greedy Algorithms - IV


14 - Pattern Matching - I


15 - Pattern Matching - II


16 - Combinational Search and Optimization I


17 - Combinational Search and Optimization II


18 - Dynamic Programming


19 - Longest Common Subsequences


20 - Matric Chain Multiplication


21 - Scheduling with Startup and Holding Costs


22 - Average case Analysis of Quicksort


23 - Bipartite Maximum Matching


24 - Lower Bounds for Sorting


25 - Element Distinctness Lower Bounds


26 - NP-Completeness-I -Motivation


27 - NP - Completeness - II


28 - NP-Completeness - III


29 - NP-Completeness - IV


30 - NP-Completeness - V


31 - NP-Completeness - VI


32 - Approximation Algorithms


33 - Approximation Algorithms


34 - Approximation Algorithms for NP