Computer Algorithms - 2

Lecture 1 - Graph_Basics

Lecture 2 - Breadth_First_Search

Lecture 3 - Dijkstra_Algo

Lecture 4 - All Pair Shortest Path

Lecture 5 - Matriods

Lecture 6 - Minimum Spanning Tree

Lecture 7 - Edmond's Matching Algo I

Lecture 8 - Edmond's Matching Algo II

Lecture 9 - 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 Ops-I

Lecture 18 - Integer-Polynomial Ops-II

Lecture 19 - Integer-Polynomial Ops-III

Lecture 20 - Chinese Remainder-I

Lecture 21 - Chinese Remainder-II

Lecture 22 - Chinese Remainder-III

Lecture 23 - Discrete Fourier Transform-I

Lecture 24 - Discrete Fourier Transform-II

Lecture 25 - Discrete Fourier Transform-III

Lecture 26 - Schonhage Strassen Algo

Lecture 27 - Linear Programming-I

Lecture 28 - Linear Programming-II

Lecture 29 - Geometry-I

Lecture 30 - Geometry-II

Lecture 31 - Geometry-III

Lecture 32 - Approximation Algo-I

Lecture 33 - Approximation Algo-II

Lecture 34 - Approximation Algo-III

Lecture 35 - General: Dynamic Programming