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