mhrd logo inflibnet logo ugc logo

Module Details

Course : Introduction To Algorhtms And Analysis

Subject : Computer science

No. of Modules : 53

Level : UG

Source : SwayamPrabha;Channel-13

Back

Sr. No. Title Creator/Author E-Text Video URL Metadata
1 Computational complexity (contd.) Prof. Sourav Mukhopadhyay - - Click Here
2 More on dynamic programming (contd.) Prof. Sourav Mukhopadhyay - - Click Here
3 Computational complexity Prof. Sourav Mukhopadhyay - - Click Here
4 More on dynamic programming Prof. Sourav Mukhopadhyay - - Click Here
5 Network flow (contd.) Prof. Sourav Mukhopadhyay - - Click Here
6 Network flow (contd.) Prof. Sourav Mukhopadhyay - - Click Here
7 Network flow Prof. Sourav Mukhopadhyay - - Click Here
8 Augmented disjoint set data structure Prof. Sourav Mukhopadhyay - - Click Here
9 Union - find Prof. Sourav Mukhopadhyay - - Click Here
10 Disjoint set data structure Prof. Sourav Mukhopadhyay - - Click Here
11 All pairs shortest path Prof. Sourav Mukhopadhyay - - Click Here
12 Johnson algorithm Prof. Sourav Mukhopadhyay - - Click Here
13 Floyd - warshall Prof. Sourav Mukhopadhyay - - Click Here
14 Application of bellman ford Prof. Sourav Mukhopadhyay - - Click Here
15 Correctness of bellman ford Prof. Sourav Mukhopadhyay - - Click Here
16 Example of dijktra Prof. Sourav Mukhopadhyay - - Click Here
17 Bellman ford Prof. Sourav Mukhopadhyay - - Click Here
18 Dijktra's Prof. Sourav Mukhopadhyay - - Click Here
19 Shortest path problem Prof. Sourav Mukhopadhyay - - Click Here
20 Graph search Prof. Sourav Mukhopadhyay - - Click Here
21 Bfs & dfs Prof. Sourav Mukhopadhyay - - Click Here
22 Prim's algorithms Prof. Sourav Mukhopadhyay - - Click Here
23 Graphs Prof. Sourav Mukhopadhyay - - Click Here
24 Longest common subsequence Prof. Sourav Mukhopadhyay - - Click Here
25 Dynamic programming Prof. Sourav Mukhopadhyay - - Click Here
26 Computational geometry ( contd.) Prof. Sourav Mukhopadhyay - - Click Here
27 Computational geometry Prof. Sourav Mukhopadhyay - - Click Here
28 Van emde boas data structure Prof. Sourav Mukhopadhyay - - Click Here
29 Amortized analysis Prof. Sourav Mukhopadhyay - - Click Here
30 Fixed universe successor Prof. Sourav Mukhopadhyay - - Click Here
31 Interval trees Prof. Sourav Mukhopadhyay - - Click Here
32 Red black tree (contd.) Prof. Sourav Mukhopadhyay - - Click Here
33 Red black tree Prof. Sourav Mukhopadhyay - - Click Here
34 Binary search tree (bst) sort Prof. Sourav Mukhopadhyay - - Click Here
35 Randomly build bst Prof. Sourav Mukhopadhyay - - Click Here
36 Universal hashing Prof. Sourav Mukhopadhyay - - Click Here
37 Perfect hashing Prof. Sourav Mukhopadhyay - - Click Here
38 Open addressing Prof. Sourav Mukhopadhyay - - Click Here
39 Worst case linear time order Prof. Sourav Mukhopadhyay - - Click Here
40 Hash function Prof. Sourav Mukhopadhyay - - Click Here
41 Randomized order statistics Prof. Sourav Mukhopadhyay - - Click Here
42 Order statistics Prof. Sourav Mukhopadhyay - - Click Here
43 Radix sort and bucket sort Prof. Sourav Mukhopadhyay - - Click Here
44 Linear time sorting Prof. Sourav Mukhopadhyay - - Click Here
45 Decision tree Prof. Sourav Mukhopadhyay - - Click Here
46 Heap sort Prof. Sourav Mukhopadhyay - - Click Here
47 Heap Prof. Sourav Mukhopadhyay - - Click Here
48 Analysis of quick sort Prof. Sourav Mukhopadhyay - - Click Here
49 Randomized quick sort Prof. Sourav Mukhopadhyay - - Click Here
50 Strassen's algorithm Prof. Sourav Mukhopadhyay - - Click Here
51 Quick sort Prof. Sourav Mukhopadhyay - - Click Here
52 Divide and comquer (contd.) Prof. Sourav Mukhopadhyay - - Click Here
53 Divide and comquer Prof. Sourav Mukhopadhyay - - Click Here