# Computer Algorithms

0( 0 REVIEWS )
1 STUDENTS

Contents:
Graph_Basics – Breadth_First_Search – Dijkstra_Algo – All Pair Shortest Path – Matriods – Minimum Spanning Tree – Edmond\’s Matching Algo – Flow Networks – Ford Fulkerson Method – Edmond Karp Algo – Matrix Inversion – Matrix Decomposition – Knuth Morris Pratt Algo – Rabin Karp Algo – NFA Simulation – Integer-Polynomial Ops – Chinese Remainder – Discrete Fourier Transform – Schonhage Strassen Algo – Linear Programming – Geometry – Approximation Algo – General: Dynamic Programming – Computer Algorithms

### Course Curriculum

 Graph_Basics Details 58:16 Breadth_First_Search Details 52:57 Dijkstra_Algo Details 1:2:11 All Pair Shortest Path Details 1:1:16 Matriods Details 49:28 Minimum Spanning Tree Details 51:41 Edmond\’s Matching Algo I Details 52:13 Edmond’s Matching Algo II Details 43:47 Flow Networks Details 54:11 Ford Fulkerson Method Details 47:26 Edmond Karp Algo Details 48:43 Matrix Inversion Details 54:12 Matrix Decomposition Details 53:19 Knuth Morris Pratt Algo Details 47:54 Rabin Karp Algo Details 44:6 NFA Simulation Details 43:41 Integer-Polynomial Ops I Details 49:53 Integer-Polynomial Ops II Details 47:35 Integer-Polynomial OpsIII Details 49:49 Chinese Remainder I Details 55:35 Chinese Remainder II Details 52:30 Chinese Remainder III Details 52:7 Discrete Fourier Transform I Details 54:29 Discrete Fourier Transform II Details 52:37 Discrete Fourier Transform III Details 49:54 Schonhage Strassen Algo Details 49:3 Linear Programming I Details 55:13 Linear Programming II Details 46:13 Geometry I Details 47:39 Geometry II Details 53:19 Geometry III Details 50:50 Approximation Algo I Details 52:15 Approximation Algo II Details 49:49 Approximation Algo III Details 49:55 General: Dynamic Programming Details 45:47 Computer Algorithms – 2 Details Computer Algorithms – 2 Details Computer Algorithms – 2 Details Computer Algorithms – 2 Details Computer Algorithms – 2 Details Computer Algorithms – 2 Details

## N.A

ratings
• 5 stars0
• 4 stars0
• 3 stars0
• 2 stars0
• 1 stars0

No Reviews found for this course.

• FREE
• UNLIMITED ACCESS