 |
Lecture – 1 Overview of the course |
Computer Science |
52 min |
Click to view videos |
 |
Lecture – 2 Framework for Algorithms Analysis |
Computer Science |
56 min |
Click to view videos |
 |
Lecture – 3 Algorithms Analysis Framework – II |
Computer Science |
53 min |
Click to view videos |
 |
Lecture – 4 Asymptotic Notation |
Computer Science |
53 min |
Click to view videos |
 |
Lecture -5 Algorithm Design Techniques : Basics |
Computer Science |
46 min |
Click to view videos |
 |
Lecture -6 Divide And Conquer-I |
Computer Science |
52 min |
Click to view videos |
 |
Lecture -7 Divide And Conquer -II Median Finding |
Computer Science |
53 min |
Click to view videos |
 |
Lecture -8 Divide And Conquer -III Surfing Lower Bounds |
Computer Science |
57 min |
Click to view videos |
 |
Lecture -9 Divide And Conquer -IV Closest Pair |
Computer Science |
64 min |
Click to view videos |
 |
Lecture -10 Greedy Algorithms -I |
Computer Science |
51 min |
Click to view videos |
 |
Lecture – 11 Greedy Algorithms – II |
Computer Science |
54 min |
Click to view videos |
 |
Lecture – 12 Greedy Algorithms – III |
Computer Science |
51 min |
Click to view videos |
 |
Lecture – 13 Greedy Algorithms – IV |
Computer Science |
37 min |
Click to view videos |
 |
Lecture – 14 Pattern Matching – I |
Computer Science |
54 min |
Click to view videos |
 |
Lecture – 15 Pattern Matching – II |
Computer Science |
45 min |
Click to view videos |
 |
Lecture -16 Combinational Search and Optimization I |
Computer Science |
55 min |
Click to view videos |
 |
Lecture – 17 Combinational Search and Optimization II |
Computer Science |
54 min |
Click to view videos |
 |
Lecture -18 Dynamic Programming |
Computer Science |
52 min |
Click to view videos |
 |
Lecture 19 Longest Common Subsequences |
Computer Science |
59 min |
Click to view videos |
 |
Lecture -20 Matric Chain Multiplication |
Computer Science |
51 min |
Click to view videos |
 |
Lecture – 21 Scheduling with Startup and Holding Costs |
Computer Science |
54 min |
Click to view videos |
 |
Lecture – 22 Average case Analysis of Quicksort |
Computer Science |
48 min |
Click to view videos |
 |
Lecture – 23 Bipartite Maximum Matching |
Computer Science |
51 min |
Click to view videos |
 |
Lecture – 24 Lower Bounds for Sorting |
Computer Science |
49 min |
Click to view videos |
 |
Lecture -25 Element Distinctness Lower Bounds |
Computer Science |
54 min |
Click to view videos |
 |
Lecture -26 NP-Completeness-I -Motivation |
Computer Science |
58 min |
Click to view videos |
 |
Lecture – 27 NP – Compliteness – II |
Computer Science |
77 min |
Click to view videos |
 |
Lecture – 28 NP-Completeness – III |
Computer Science |
57 min |
Click to view videos |
 |
Lecture – 29 NP-Completeness – IV |
Computer Science |
70 min |
Click to view videos |
 |
Lecture – 30 NP-Completeness – V |
Computer Science |
41 min |
Click to view videos |
 |
Lecture – 31 NP-Completeness – VI |
Computer Science |
41 min |
Click to view videos |
 |
Lecture – 32 Approximation Algorithms |
Computer Science |
55 min |
Click to view videos |
 |
Lecture – 33 Approximation Algorithms |
Computer Science |
58 min |
Click to view videos |
 |
Lecture – 34 Approximation Algorithms for NP |
Computer Science |
54 min |
Click to view videos |
Leave a Reply