Part of NPTEL Course on Design and Analysis of Algorithms

To view these lessons you will require to have java 1.3+ plugin installed on your machine.

Introduction To The Course

The Algorithm Analysis Framework

Another Example Of Algorithm Analysis

Asymptotic Notation

Discrete Optimization: Introduction and Backtrack Search

Discrete Optimization: Branch and Bound

Knapsack

Longest Common Subsequence

Matrix Chain Multiplication

A Scheduling Problem

Average Case Analysis Of Quicksort

Maximum Bipartite Matching

Lower Bounds: Sorting

Element Distinctness Lower Bound

Approximation Algorithms I

Approximation Algorithms II

Approximation Algorithms III