IIT Kharagpur · Computer Science

Introduction to algorithms and analysis

Prof. Sourav Mukhopadhyay · 60 free video lectures

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1: Insertion sort
  2. Lecture 2: Analysis of Insertion Sort
  3. Lecture 3: Asymptotic Notation
  4. Lecture 4: Recurrence for Merge Sort
  5. Lecture 5: Substitution Method
  6. Lecture 6: The Master Method
  7. Lecture 7: Divide-and-Conquer
  8. Lecture 8: Divide-and-Conquer (Contd..)
  9. Lecture 9: Straseen's Algorithms
  10. Lecture 10: QuickSort
  11. Lecture 11: Analysis of Quicksort.
  12. Lecture 12: Randomized Quicksort
  13. Lecture 13: Heap
  14. Lecture 14: Heap Sort
  15. Lecture 15: Decision Tree
  16. Lecture 16: Linear time Sorting
  17. Lecture 17: Radix Sort & Bucket Sort
  18. Lecture 18: Order Statistics
  19. Lecture 19: Order Statistics (Contd.)
  20. Lecture 20: Worst case linear time order statistics
  21. Lecture 21 : Hash Function
  22. Lecture 22 : Open Addressing
  23. Lecture 23 : Universal Hashing
  24. Lecture 24 : Perfect Hashing
  25. Lecture 25 : Binary Search Tree (BST) Sort
  26. Lecture 26: Randomly build BST
  27. Lecture 27: Red Black Tree
  28. Lecture 28: Red Black Tree (Cont...)
  29. Lecture 29: Augmentation of data structure
  30. Lecture 30: Interval trees
  31. Lecture 31 : Fixed Universe Successor
  32. Lecture 32 : Van Emde Boas data structure
  33. Lecture 33: Amortized Analysis
  34. Lecture 34: Computational Geometry
  35. Lecture 35: Computational Geometry (cont....)
  36. Lecture 36: Dynamic Programming
  37. Lecture 37: Longest common subsequence
  38. Lecture 38: Graphs
  39. Lecture 39: Prim's Algorithms
  40. Lecture 40: Graph Search
  41. Lecture 41: BFS & DFS
  42. Lecture 42: Shortest path problem
  43. Lecture 43: Dijktra's
  44. Lecture 44:Example of Dijktra
  45. Lecture 45: Bellman Ford
  46. Lecture 46: Correctness of Bellman Ford
  47. Lecture 47: Application of Bellman Ford
  48. Lecture 48: All pairs shortest path
  49. Lecture 49: Floyd-Warshall
  50. Lecture 50: Johnson Algorithm
  51. Lecture 51 : Disjoint set data structure
  52. Lecture 52 : Union-Find
  53. Lecture 53 : Augmented disjoint set data structure
  54. Lecture 54 : Network flow
  55. Lecture 55 : Network Flow (cont...)
  56. Lecture 56 : Network Flow (cont...)
  57. Lecture 57 : More on Dynamic Programming
  58. Lecture 58 : More on Dynamic Programming (cont...)
  59. Lecture 59 : Computational Complexity
  60. Lecture 60 : Computational Complexity (cont...)

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