IIT Kharagpur · Computer Science

Algorithmic Graph Theory and Data Structures

Prof. Sourav Mukhopadhyay · 60 free video lectures

60 video lectures. Topics: Lecture No - 01 : Introduction; Lecture No - 02 : Analysis of Algorithm; Lecture No - 03 : Time Complexity; Lecture No - 04 : Merge Sort; Lecture No - 05 : Solving the recurrences; Lecture No - 06 : Solving the recurrences (Cont…); Lecture No - 07 : Divide and Conquer…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture No - 01 : Introduction
  2. Lecture No - 02 : Analysis of Algorithm
  3. Lecture No - 03 : Time Complexity
  4. Lecture No - 04 : Merge Sort
  5. Lecture No - 05 : Solving the recurrences
  6. Lecture No - 06 : Solving the recurrences (Cont…)
  7. Lecture No - 07 : Divide and Conquer Algorithms
  8. Lecture No - 08 : Fibonacci numbers and Matrix multiplication
  9. Lecture No - 09 : Quicksort
  10. Lecture No - 10 : Randomized Quicksort
  11. Lecture No - 11 : Heapsort
  12. Lecture No - 12 : Linear time sorting
  13. Lecture No - 13 : Linear time sorting (Cont…)
  14. Lecture No - 14 : Order Statistics
  15. Lecture No - 15 : Order Statistics (Cont…)
  16. Lecture No - 16 : Hash Function
  17. Lecture No - 17 : Open Addressing Hashing
  18. Lecture No - 18 : Universal Hash Functions
  19. Lecture No - 19 : Perfect Hashing
  20. Lecture No - 20 : Heap
  21. Lecture No - 21 : Binary Search Tree
  22. Lecture No - 22 : Binary Search Tree Sort
  23. Lecture No - 23 : Randomly build binary search tree
  24. Lecture No - 24 : Balanced Binary Search Tree
  25. Lecture No - 25 : Red Black Tree
  26. Lecture No - 26 : Data-structure augmentation
  27. Lecture No - 27 : Interval Trees
  28. Lecture No - 28 : Fixed Universe Successor
  29. Lecture No - 29 : Van Emde Boas
  30. Lecture No - 30 : Computational Geometry
  31. Lecture No - 31 : Orthogonal Range Tree
  32. Lecture No - 32 : Amortized Analysis
  33. Lecture No - 33 : Amortized Analysis (Cont...)
  34. Lecture No - 34 : Disjoint Set
  35. Lecture No - 35 : Disjoint Set (Cont...)
  36. Lecture No - 36 : Dynamic Programming (DP)
  37. Lecture No - 37 : Introduction to Graphs
  38. Lecture No - 38 : Minimum Spanning Tree
  39. Lecture No - 39 : Prim’s Algorithm
  40. Lecture No - 40 : Kruskal Algorithm
  41. Lecture No - 41 : Graph Search Algorithm
  42. Lecture No - 42 : Depth First Search (DFS)
  43. Lecture No - 43 : Application of DFS
  44. Lecture No - 44 : Breadth-First Search (BFS)
  45. Lecture No - 45 : Shortest Path Algorithm
  46. Lecture No - 46 : Dijkstra’s Algorithm
  47. Lecture No - 47 : Bellman-Ford Algorithm
  48. Lecture No - 48 : Bellman-Ford (Cont…)
  49. Lecture No - 49 : Application of Bellman-Ford
  50. Lecture No - 50 : Johnson’s Algorithm
  51. Lecture No - 51 : All Pairs Shortest Paths
  52. Lecture No- 52 : Floyd-Warshall
  53. Lecture No-53 : Flow Network
  54. Lecture No-54 : Flow Network (Cont...)
  55. Lecture No- 55 : Ford-Fulkerson max-flow
  56. Lecture No - 56 : Maximum Flow, Min Cut Theorem
  57. Lecture No- 57 : Edmonds-Karp Algorithm
  58. Lecture No-58 : Edmonds-Karp Max Flow Algorithm
  59. Lecture No-59 : Dynamic Programming-II
  60. Lecture No- 60 : Computational Complexity

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