Algorithms Lectures for Spring 2004

Lecture 29 (4-27-04) TSP Approximation Algorithm

Lecture 25 (4-13-04) CNF-SAT and clique problems

Lecture 24 (4-8-04) Problem P and NP

Lecture 23 (4-6-04) Backtracking: Job-Assignment problem

Lecture 22 (4-1-04) Lower-bound arguments

Lecture 21 (3-30-04) Computational Complexity for the search problem

Lecture 14 (2-26-04) Backtracking: Coin Changing problem

Lecture 13 (2-24-04) Backtracking: Coin Changing problem

Lecture 11 (2-17-04) Greedy Technique: Dijkstra's single-source shortest path

Lecture 9 (2-10-04) Dynamic Programming: TSP

Lecture 8 (2-5-04) Dynamic Programming: Floyd's and Optimal BST

Lecture 7 (2-3-04) Dynamic Programming: Binomial Coefficient

Lecture 6 (1-29-04) Divide-and-Conquer: Coin-change overheads

Lecture 6 (1-29-04) Divide-and-Conquer: Coin-change questions

Lecture 5 (1-27-04) Recursive Analysis/Solving Recurrences using Characteristic Equation

Lecture 4 (1-22-04) Divide-and-Conquer: Binary Search and Merge Sort

Lecture 2 (1-15-04) Notes

Lecture 2 (1-15-04) Analysis of Loops

Lecture 1 (1-13-04) Introduction