Computer Algorithms - 2

Computer Algorithms - 2

nptelhrd via YouTube Direct link

Mod-01 Lec-01 Graph_Basics

1 of 35

1 of 35

Mod-01 Lec-01 Graph_Basics

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Computer Algorithms - 2

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Mod-01 Lec-01 Graph_Basics
  2. 2 Mod-01 Lec-02 Breadth_First_Search
  3. 3 Mod-01 Lec-03 Dijkstra_Algo
  4. 4 Mod-01 Lec-04 All Pair Shortest Path
  5. 5 Mod-01 Lec-05 Matriods
  6. 6 Mod-01 Lec-06 Minimum Spanning Tree
  7. 7 Mod-01 Lec-07 Edmond\\\'s Matching Algo I
  8. 8 Mod-01 Lec-08 Edmond\'s Matching Algo II
  9. 9 Mod-01 Lec-09 Flow Networks
  10. 10 Mod-01 Lec-10 Ford Fulkerson Method
  11. 11 Mod-01 Lec-11 Edmond Karp Algo
  12. 12 Mod-01 Lec-12 Matrix Inversion
  13. 13 Mod-01 Lec-13 Matrix Decomposition
  14. 14 Mod-01 Lec-14 Knuth Morris Pratt Algo
  15. 15 Mod-01 Lec-15 Rabin Karp Algo
  16. 16 Mod-01 Lec-16 NFA Simulation
  17. 17 mod-01 Lec-17 Integer-Polynomial Ops I
  18. 18 Mod-01 Lec-18 Integer-Polynomial Ops II
  19. 19 Mod-01 Lec-19 Integer-Polynomial OpsIII
  20. 20 Mod-01 Lec-20 Chinese Remainder I
  21. 21 Mod-01 Lec-21 Chinese Remainder II
  22. 22 Mod-01 Lec-22 Chinese Remainder III
  23. 23 Mod-01 Lec-23 Discrete Fourier Transform I
  24. 24 Mod-01 Lec-24 Discrete Fourier Transform II
  25. 25 Mod-01 Lec-25 Discrete Fourier Transform III
  26. 26 Mod-01 Lec-26 Schonhage Strassen Algo
  27. 27 Mod-01 Lec-27 Linear Programming I
  28. 28 Mod-01 Lec-28 Linear Programming II
  29. 29 Mod-01 Lec-29 Geometry I
  30. 30 Mod-01 Lec-30 Geometry II
  31. 31 Mod-01 Lec-31 Geometry III
  32. 32 Mod-01 Lec-32 Approximation Algo I
  33. 33 Mod-01 Lec-33 Approximation Algo II
  34. 34 Mod-01 Lec-34 Approximation Algo III
  35. 35 Mod-01 Lec-35 General: Dynamic Programming

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.