Partial Schedule for Algorithms - Fall 2002

Date	Topics	Reading and Assignments
8/27	Motivation for Algorithms - best time and space complexity Divide-and-Conquer -- Fibonacci seq. Text syntax; Big-oh notation Review of parameter passing and run-time stack; Recurrence relations Recursion Tree	Read sections 1.0 - 1.4.1; 2.1-2.3; 2.8
8/29	Dynamic programming -- Fibonacci seq. 1-D array Run-time - theta notation Space optimization Dynamic programming -- Binomial Coefficient Dynamic programming using "Memorization Technique" Divide-and-Conquer -- Merge-sort	Read sections 3.0-3.3; 3.6 and A.7
9/3	Greedy Approach -- Making change Divide-and-Conquer -- Making Change Dynamic programming -- Making Change	Read sections 4.0
9/10	Backtracking -- Making Change	Read sections 5.0 - 5.1
9/17	Branch-and-bound -- Making Change Knapsack problems	Read sections 6.0
9/24	TSP (Traveling Salesperson Problem)
10/1
10/8
10/15
10/22
10/29
11/5
11/12
11/19	Test 2
11/26
12/3
12/10
12/18	1-2:50 PM Wednesday, December 18