Syllabus | Option |
---|---|
Syllabus | Download |
Chapter | Option |
---|---|
Models of Computation | Download |
Insertion Sort | Download |
Asymptotic Notation | Download |
Analyzing Algorithms | Download |
Designing Algorithms | Download |
Divide & Conquer | Download |
Optimization I - Greedy Strategy | Download |
Dynamic Programming | Download |
Graph Algorithms | Download |
NP Copmleteness and Approximation Algorithms | Download |
Chapter | Option |
---|---|
Asymptotic Notations [17:47] | Watch Here |
Algorithm Design Techniques : Basics [46:23] | Watch Here |
Divide And Conquer-I [52:09] | Watch Here |
Greedy Algorithms -I [51:18] | Watch Here |
Greedy Algorithms - II [53:58] | Watch Here |
Greedy Algorithms - III [50:43] | Watch Here |
Greedy Algorithms - IV [36:44] | Watch Here |
Dynamic Programming [52:18] | Watch Here |
NP-Completeness-I -Motivation [58:15] | Watch Here |
NP - Completeness - II [1:16:38] | Watch Here |
NP-Completeness - III [57:23] | Watch Here |
NP-Completeness - IV [1:10:10] | Watch Here |
NP-Completeness - V [41:18] | Watch Here |
NP-Completeness - VI [40:57] | Watch Here |
Approximation Algorithms [55:02] | Watch Here |
Approximation Algorithms [58:12] | Watch Here |
Approximation Algorithms for NP [53:38] | Watch Here |
Storage Structures [54:55] | Watch Here |
Chapter | Option |
---|---|
FULL LENGTH MODEL PAPER | Download |