IIT Kharagpur · Computer Science

Fundamental Algorithms:Design and Analysis

Prof.Sourav Mukhopadhyay · 20 free video lectures

20 video lectures. Topics: Insertion Sort and Asymptotic Analysis; Solving Recurrences; Divide and Conquer Paradigm; Quick Sort; Heap Sort; Decision Tree; Linear Time Sorting; Order Statistics; Hashing; Universal Hashing, BST Sort; Red-Black Tree; Augmenting Data Structure; Computational Geometry…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 01 : Insertion Sort and Asymptotic Analysis
  2. Lecture 02: Solving Recurrences
  3. Lecture 03: Divide and Conquer Paradigm
  4. Lecture 04: Quick Sort
  5. Lecture 05 : Heap Sort
  6. Lecture 06: Decision Tree
  7. Lecture 07: Linear Time Sorting
  8. Lecture 08: Order Statistics
  9. Lecture 09: Hashing
  10. Lecture 10: Universal Hashing, BST Sort
  11. Lecture 11: Red-Black Tree
  12. Lecture 12: Augmenting Data Structure
  13. Lecture13: Computational Geometry
  14. Lecture 14: Van Emde Boas Data Structure
  15. Lecture 15: Dynamic Programming
  16. Lecture 16 : Graph Algorithm
  17. Lecture 17 : BFS and DFS
  18. Lecture 18 : Dijkstra
  19. Lecture 19 : Bellman Ford
  20. Lecture 20 : Floyd Marshall

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kharagpur.

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