Curriculum
- 1 Section
- 36 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Computer Algorithms36
- 2.1Mod-01 Lec-01 Graph_Basics
- 2.2Mod-01 Lec-02 Breadth_First_Search
- 2.3Mod-01 Lec-03 Dijkstra_Algo
- 2.4Mod-01 Lec-04 All Pair Shortest Path
- 2.5Mod-01 Lec-05 Matriods
- 2.6Mod-01 Lec-06 Minimum Spanning Tree
- 2.7Mod-01 Lec-07 Edmond’s Matching Algo I
- 2.8Mod-01 Lec-08 Edmond’s Matching Algo II
- 2.9Mod-01 Lec-09 Flow Networks
- 2.10Mod-01 Lec-10 Ford Fulkerson Method
- 2.11Mod-01 Lec-10 Ford Fulkerson Method
- 2.12Mod-01 Lec-11 Edmond Karp Algo
- 2.13Mod-01 Lec-12 Matrix Inversion
- 2.14Mod-01 Lec-13 Matrix Decomposition
- 2.15Mod-01 Lec-14 Knuth Morris Pratt Algo
- 2.16Mod-01 Lec-15 Rabin Karp Algo
- 2.17Mod-01 Lec-16 NFA Simulation
- 2.18mod-01 Lec-17 Integer-Polynomial Ops I
- 2.19Mod-01 Lec-18 Integer-Polynomial Ops II
- 2.20Mod-01 Lec-19 Integer-Polynomial OpsIII
- 2.21Mod-01 Lec-20 Chinese Remainder I
- 2.22Mod-01 Lec-21 Chinese Remainder II
- 2.23Mod-01 Lec-22 Chinese Remainder III
- 2.24Mod-01 Lec-23 Discrete Fourier Transform I
- 2.25Mod-01 Lec-24 Discrete Fourier Transform II
- 2.26Mod-01 Lec-25 Discrete Fourier Transform III
- 2.27Mod-01 Lec-26 Schonhage Strassen Algo
- 2.28Mod-01 Lec-27 Linear Programming I
- 2.29Mod-01 Lec-28 Linear Programming II
- 2.30Mod-01 Lec-29 Geometry I
- 2.31Mod-01 Lec-30 Geometry II
- 2.32Mod-01 Lec-31 Geometry III
- 2.33Mod-01 Lec-32 Approximation Algo I
- 2.34Mod-01 Lec-33 Approximation Algo II
- 2.35Mod-01 Lec-34 Approximation Algo III
- 2.36Mod-01 Lec-35 General: Dynamic Programming