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

  1. Introduction to Data Structures and Algorithms
  2. Stacks
  3. Queues and Linked Lists
  4. Dictionaries
  5. Hashing
  6. Trees
  7. Tree Walks / Traversals
  8. Ordered Dictionaries
  9. Deletion
  10. Quick Sort
  11. AVL Trees
  12. AVL Trees
  13. Trees
  14. Red Black Trees
  15. Insertion in Red Black Trees
  16. Disk Based Data Structures
  17. Case Study: Searching for Patterns
  18. Tries
  19. Data Compression
  20. Priority Queues
  21. Binary Heaps
  22. Why Sorting
  23. More Sorting
  24. Graphs
  25. Data Structures for Graphs
  26. Two Applications of Breadth First Search
  27. Depth First Search
  28. Applications of DFS
  29. DFS in Directed Graphs
  30. Applications of DFS in Directed Graphs
  31. Minimum Spanning Trees
  32. The Union
  33. Prims Algorithm for Minimum Spanning Trees
  34. Single Source Shortest Paths
  35. Correctness of Dijkstras Algorithm
  36. 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