Media Storage Type : 32 GB USB Stick
NPTEL Subject Matter Expert : Prof. Naveen Garg
NPTEL Co-ordinating Institute : IIT Delhi
NPTEL Lecture Count : 36
NPTEL Course Size : 9.3 GB
NPTEL PDF Text Transcription : Available and Included
NPTEL Subtitle Transcription : Available and Included (SRT)
Lecture Titles:
Lecture 1 - Introduction to Data Structures and Algorithms
Lecture 2 - Stacks
Lecture 3 - Queues and Linked Lists
Lecture 4 - Dictionaries
Lecture 5 - Hashing
Lecture 6 - Trees
Lecture 7 - Tree Walks / Traversals
Lecture 8 - Ordered Dictionaries
Lecture 9 - Deletion
Lecture 10 - Quick Sort
Lecture 11 - AVL Trees
Lecture 12 - AVL Trees
Lecture 13 - Trees
Lecture 14 - Red Black Trees
Lecture 15 - Insertion in Red Black Trees
Lecture 16 - Disk Based Data Structures
Lecture 17 - Case Study: Searching for Patterns
Lecture 18 - Tries
Lecture 19 - Data Compression
Lecture 20 - Priority Queues
Lecture 21 - Binary Heaps
Lecture 22 - Why Sorting
Lecture 23 - More Sorting
Lecture 24 - Graphs
Lecture 25 - Data Structures for Graphs
Lecture 26 - Two Applications of Breadth First Search
Lecture 27 - Depth First Search
Lecture 28 - Applications of DFS
Lecture 29 - DFS in Directed Graphs
Lecture 30 - Applications of DFS in Directed Graphs
Lecture 31 - Minimum Spanning Trees
Lecture 32 - The Union
Lecture 33 - Prims Algorithm for Minimum Spanning Trees
Lecture 34 - Single Source Shortest Paths
Lecture 35 - Correctness of Dijkstras Algorithm
Lecture 36 - Single Source Shortest Paths