IIT Delhi · Computer Science
Data Structures And Algorithms
Prof. Naveen Garg · 36 free video lectures
36 video lectures. Topics: Introduction to Data Structures and Algorithms; Stacks; Queues and Linked Lists; Dictionaries; Hashing; Trees; Tree Walks / Traversals; Ordered Dictionaries; Deletion; Quick Sort; AVL Trees; Red Black Trees; Insertion in Red Black Trees; Disk Based Data Structures; Case…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction to Data Structures and Algorithms
- Stacks
- Queues and Linked Lists
- Dictionaries
- Hashing
- Trees
- Tree Walks / Traversals
- Ordered Dictionaries
- Deletion
- Quick Sort
- AVL Trees
- AVL Trees
- Trees
- Red Black Trees
- Insertion in Red Black Trees
- Disk Based Data Structures
- Case Study: Searching for Patterns
- Tries
- Data Compression
- Priority Queues
- Binary Heaps
- Why Sorting
- More Sorting
- Graphs
- Data Structures for Graphs
- Two Applications of Breadth First Search
- Depth First Search
- Applications of DFS
- DFS in Directed Graphs
- Applications of DFS in Directed Graphs
- Minimum Spanning Trees
- The Union
- Prims Algorithm for Minimum Spanning Trees
- Single Source Shortest Paths
- Correctness of Dijkstras Algorithm
- Single Source Shortest Paths
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Delhi.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights