## Design and Analysis of Algorithms

Design and Analysis of Algorithms. Instructor: Prof. Madhavan Mukund, Chennai Mathematical Institute. This course will cover basic concepts in the design and analysis of algorithms: analysis of algorithms; searching and sorting; algorithms on graphs; data structures - union-find and heaps, divide-and-conquer, search trees, greedy algorithms; dynamic programming; linear programming and network flows, intractability.
(from **nptel.ac.in**)

Lecture 24 - Directed Acyclic Graphs: Longest Paths |

Go to **the Course Home** or watch other lectures: