mhrd logo inflibnet logo ugc logo

Module Details

Course : Data Structures And Algorithms

Subject : Computer science

No. of Modules : 61

Level : FACULTY,STUDENTS,UG

Source : SwayamPrabha;Channel-13

Back

Sr. No. Title Creator/Author E-Text Video URL Metadata
1 Single source shortest paths Prof.Naveen Garg - - Click Here
2 Correctness of dijkstra's algorithm Prof.Naveen Garg - - Click Here
3 Single source shortest paths Prof.Naveen Garg - - Click Here
4 Prim's algorithm for minimum spanning trees Prof.Naveen Garg - - Click Here
5 The union - find data structure and kruskal's algorithm for mst Prof.Naveen Garg - - Click Here
6 Minimum spanning trees Prof.Naveen Garg - - Click Here
7 Applications of dfs in directed graphs Prof.Naveen Garg - - Click Here
8 Dfs in directed graphs Prof.Naveen Garg - - Click Here
9 Applications of dfs Prof.Naveen Garg - - Click Here
10 Depth first search ( dfs ) Prof.Naveen Garg - - Click Here
11 Two applications of breadth first search - connected components -bipartite graphs Prof.Naveen Garg - - Click Here
12 Data structures for graphs Prof.Naveen Garg - - Click Here
13 More sorting Prof. Naveen Garg - - Click Here
14 Why sorting Prof. Naveen Garg - - Click Here
15 Data compression Prof. Naveen Garg - - Click Here
16 Tries Prof. Naveen Garg - - Click Here
17 Insertion in red black trees Prof. Naveen Garg - - Click Here
18 Quick sort Prof. Naveen Garg - - Click Here
19 Deletion Prof. Naveen Garg - - Click Here
20 Tree walks / traversals Prof. Naveen Garg - - Click Here
21 Ordered dictionaries Prof. Naveen Garg - - Click Here
22 Trees Prof. Naveen Garg - - Click Here
23 Hashing (contd.) Prof. Naveen Garg - - Click Here
24 Queues and linked lists Prof. Naveen Garg - - Click Here
25 Stacks Prof. Naveen Garg - - Click Here
26 Queues and linked lists Prof. Naveen Garg - - Click Here
27 Tree walks / traversals Prof. Naveen Garg - - Click Here
28 Ordered dictionaries Prof. Naveen Garg - - Click Here
29 Dictionaries Prof. Naveen Garg - - Click Here
30 Quick sort Prof. Naveen Garg - - Click Here
31 Avl trees Prof. Naveen Garg - - Click Here
32 Deletion Prof. Naveen Garg - - Click Here
33 Hashing Prof. Naveen Garg - - Click Here
34 Trees Prof. Naveen Garg - - Click Here
35 Two applications of breadth first search Prof. Naveen Garg - - Click Here
36 Data structures for graphs Prof. Naveen Garg - - Click Here
37 Dfs in directed graphs Prof. Naveen Garg - - Click Here
38 Applications of dfs Prof. Naveen Garg - - Click Here
39 Depth first search Prof. Naveen Garg - - Click Here
40 Binary heaps Prof. Naveen Garg - - Click Here
41 More sorting Prof. Naveen Garg - - Click Here
42 Why sorting Prof. Naveen Garg - - Click Here
43 Graphs Prof. Naveen Garg - - Click Here
44 Introduction to data structures and algorithms Prof. Naveen Garg - - Click Here
45 Stacks Prof. Naveen Garg - - Click Here
46 Case study: searching for patterns Prof. Naveen Garg - - Click Here
47 Insertion in red black trees Prof. Naveen Garg - - Click Here
48 Disk based data structures Prof. Naveen Garg - - Click Here
49 Data compression Prof. Naveen Garg - - Click Here
50 Red black trees Prof. Naveen Garg - - Click Here
51 Priority queues Prof. Naveen Garg - - Click Here
52 Avl trees Prof. Naveen Garg - - Click Here
53 Trees Prof. Naveen Garg - - Click Here
54 Tries Prof. Naveen Garg - - Click Here
55 Prims algorithm for minimum spanning trees Prof. Naveen Garg - - Click Here
56 Applications of dfs in directed graphs Prof. Naveen Garg - - Click Here
57 Correctness of dijkstras algorithm Prof. Naveen Garg - - Click Here
58 Single source shortest paths Prof. Naveen Garg - - Click Here
59 Single source shortest paths Prof. Naveen Garg - - Click Here
60 Minimum spanning trees Prof. Naveen Garg - - Click Here
61 The union Prof. Naveen Garg - - Click Here