IIT Kanpur · Computer Science

Computer Algorithms - 2

Prof. Shashank K. Mehta · 35 free video lectures

35 video lectures. Topics: Graph_Basics; Breadth_First_Search; Dijkstra_Algo; All Pair Shortest Path; Matriods; Minimum Spanning Tree; Edmond's Matching Algo I; Edmond's Matching Algo II; Flow Networks; Ford Fulkerson Method; Edmond Karp Algo; Matrix Inversion; Matrix Decomposition; Knuth Morris…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture-01-Graph_Basics
  2. Lecture-02-Breadth_First_Search
  3. Lecture-03-Dijkstra_Algo
  4. Lecture-04-All Pair Shortest Path
  5. Lecture-05-Matriods
  6. Lecture-06-Minimum Spanning Tree
  7. Lecture-07-Edmond's Matching Algo I
  8. Lecture-08-Edmond's Matching Algo II
  9. Lecture-09-Flow Networks
  10. Lecture-10-Ford Fulkerson Method
  11. Lecture-11-Edmond Karp Algo
  12. Lecture-12-Matrix Inversion
  13. Lecture-13-Matrix Decomposition
  14. Lecture-14-Knuth Morris Pratt Algo
  15. Lecture-15-Rabin Karp Algo
  16. Lecture-16-NFA Simulation
  17. Lecture-17-Integer-Polynomial OpsI
  18. Lecture-18-Integer-Polynomial OpsII
  19. Lecture-19-Integer-Polynomial OpsIII
  20. Lecture-20-Chinese RemainderI
  21. Lecture-21-Chinese RemainderII
  22. Lecture-22-Chinese RemainderIII
  23. Lecture-23-:Discrete Fourier TransformI
  24. Lecture-24-Discrete Fourier TransformII
  25. Lecture-25-Discrete Fourier TransformIII
  26. Lecture-26-Schonhage Strassen Algo
  27. Lecture-27-Linear ProgrammingI
  28. Lecture-28-Linear ProgrammingII
  29. Lecture-29-GeometryI
  30. Lecture-30-GeometryII
  31. Lecture-31-GeometryIII
  32. Lecture-32-Approximation AlgoI
  33. Lecture-33-Approximation AlgoII
  34. Lecture-34-Approximation AlgoIII
  35. Lecture-35-General: Dynamic Programming

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

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