Note: Downloads have been temporarily disabled. Please await further intimation from us.

Sl.No Chapter Name Transcript Download
1Course Outline English(PDF)|Hindi(PDF)
2Example: Air Travel English(PDF)|Hindi(PDF)
3Example: Xerox shop English(PDF)|Hindi(PDF)
4Example: Document similarity English(PDF)|Hindi(PDF)
5Introduction and motivation English(PDF)|Hindi(PDF)
6Input size, worst case, average case English(PDF)|Hindi(PDF)
7Quantifying efficiency: O( ), Omega( ), Theta( ) English(PDF)|Hindi(PDF)
8Examples: Analysis of iterative and recursive algorithms English(PDF)|Hindi(PDF)
9Arrays and lists English(PDF)|Hindi(PDF)
10Searching in an array English(PDF)|Hindi(PDF)
11Selection Sort English(PDF)|Hindi(PDF)
12Insertion sort English(PDF)|Hindi(PDF)
13Merge sort English(PDF)|Hindi(PDF)
14Merge sort - analysis English(PDF)|Hindi(PDF)
15Quicksort English(PDF)|Hindi(PDF)
16Quicksort - analysis English(PDF)|Hindi(PDF)
17Sorting - Concluding remarks English(PDF)|Hindi(PDF)
18Introduction to graphs English(PDF)|Hindi(PDF)
19Representing graphs English(PDF)|Hindi(PDF)
20Breadth first search (BFS) English(PDF)|Hindi(PDF)
21Depth first search (DFS) English(PDF)|Hindi(PDF)
22Applications of BFS and DFS English(PDF)|Hindi(PDF)
23Directed acylic graphs: topological sort English(PDF)|Hindi(PDF)
24Directed acylic graphs: longest paths English(PDF)|Hindi(PDF)
25Single source shortest paths: Dijkstras algorithm English(PDF)|Hindi(PDF)
26Dijkstras algorithm: analysis English(PDF)|Hindi(PDF)
27Negative edge weights: Bellman-Ford algorithm English(PDF)|Hindi(PDF)
28All pairs shortest paths English(PDF)|Hindi(PDF)
29Minimum Cost Spanning Trees English(PDF)|Hindi(PDF)
30Prims Algorithm English(PDF)|Hindi(PDF)
31Kruskals algorithm English(PDF)|Hindi(PDF)
32Union-Find using arrays English(PDF)|Hindi(PDF)
33Union-Find using pointers English(PDF)|Hindi(PDF)
34Priority queues English(PDF)|Hindi(PDF)
35Heaps English(PDF)|Hindi(PDF)
36Heaps: Updating values, sorting English(PDF)|Hindi(PDF)
37Counting inversions English(PDF)|Hindi(PDF)
38Closest pair of points English(PDF)|Hindi(PDF)
39Binary Search Trees English(PDF)|Hindi(PDF)
40Balanced search trees English(PDF)|Hindi(PDF)
41Interval scheduling English(PDF)|Hindi(PDF)
42Scheduling with deadlines: minimizing lateness English(PDF)|Hindi(PDF)
43Huffman codes English(PDF)|Hindi(PDF)
44Introduction to dynamic programming English(PDF)|Hindi(PDF)
45Memoization English(PDF)|Hindi(PDF)
46Grid Paths English(PDF)|Hindi(PDF)
47Common subwords and subsequences English(PDF)|Hindi(PDF)
48Edit distance English(PDF)|Hindi(PDF)
49Matrix multiplication English(PDF)|Hindi(PDF)
50Linear Programming English(PDF)|Hindi(PDF)
51LP modelling: Production Planning English(PDF)|Hindi(PDF)
52LP modelling: Bandwidth allocation English(PDF)|Hindi(PDF)
53Network Flows English(PDF)|Hindi(PDF)
54Reductions English(PDF)|Hindi(PDF)
55Checking Algorithms English(PDF)|Hindi(PDF)
56P and NP English(PDF)|Hindi(PDF)
Sl.No Chapter Name MP4 Download Transcript Download