Tentative Lecture Schedule
Tentative Lecture Schedule
This schedule is tentative and is subject to change through out the quarter.
| Date (Tuesday ) | Topics | Date (Thursday) | Topics |
| Apr. 4 | Overview, Hanoi Tower | Apr. 6 | Sorting, Binary Search |
| Apr. 11 | Convex Hull | Apr. 13 | Closest Points |
| Apr. 18 | Multiplying Big Integers, Largest Partial Sum, Overview of greedy algorithms | Apr. 20 | Knapsack, Storage on tape problems |
| Apr. 25 | Huffman Coding | Apr. 27 | Minimum-cost Spanning Tree |
| May 2 | Single-source Shortest Path Algorithm | May 4 | Job Scheduling with Deadline, Greedy as Heuristics |
| May 9 | Overview of DP, 0/1 Knapsack | May 11 | Midterm |
| May 16 | Polygon triangulation, Programming assignment #3 | May 18 | Matrix chain multiplication, optimal binary search tree |
| May 23 | Traveling Salesman, World series odd | May 25 | Randomized Algorithms, Curve Fitting, Robot Navigation |
| May 30 | Complexity classes, P, NP, NP completeness, NP hard | Jun. 1 | Reduction |
| Jun. 6 | Back Tracking, Sum of subsets, 0/1-knapsack | June 8 | B&B Search |
| Jun. 13 | Final exam (8am - 11am) |
