This is a tentative schedule for CS1510 for Fall 2006. This is to give you an idea on the coverage and the pace of the course. Entries with yellow background contain tentative information and is subject to change. Check back regularly for reading assignments, homework assignments, and lecture notes. Other important updates that do not fit here are on the "Updates" page.
|
Class |
Date |
Topics of Reading and Pre-meeting Assignments |
Homework | HW assign date | HW due date |
|
1 |
M 8/28 |
introduction, goals, applications, examples |
--- | --- | --- |
| 2 | W 8/30 |
Chapter 4: Greedy Approach GD1 - scheduling to minimize average waiting time (hair stylist problem) - scheduling weighted unit tasks - scheduling weighted tasks of different length - components of greedy approach - simple "exchange argument" - minimum spanning tree problem |
hw01-greedy1.doc | W 8/30 | W 9/6 |
| - | M 9/4 | --- Labor Day. No class. --- | --- | --- | --- |
| 3 | W 9/6 |
GD2 - Prim's minimum spanning tree algorithm - "exchange argument" in "promising partial solution" proof technique - Kruskal's minimum spanning tree algorithm - |
|||
| 4 | M 9/11 |
GD3 - Dijkstra's shortest path algorithm |
hw02-greedy2.doc hw02-greedy2-sol.doc |
M 9/11 | M 9/20 |
| 5 | W 9/13 |
GD4 - activity selection problem - - |
--- | --- | --- |
| 6 | M 9/18 |
GD5 - Huffman code - unit task deadline scheduling to maximize profit |
--- | --- | --- |
| 7 | W 9/20 |
- unit task deadline scheduling to maximize profit Chapter 3: Dynamic programming DP1 - general coin change problem |
hw03-greedy-DP.doc hw03-greedy-DP-sol.doc |
W 9/20 | W 9/27 |
| 8 | M 9/25 |
DP2 - knapsack problem - chained matrix multiplication |
--- | --- | --- |
| 9 | W 9/27 |
DP3 - optimal binary search tree - - |
hw04-DP.doc hw04-DP-sol.doc |
W 9/27 | W 10/4 |
| 10 | M 10/2 |
DP4 - several attempts on Longest Increasing Subsequence problem |
--- | --- | --- |
| 11 | W 10/4 |
DP5 - longest common subsequence - sequence alignment |
hw05-DP.doc hw05-DP-sol.doc |
W 10/4 | W 10/11 |
| 12 | M 10/9 |
DP6 - bitonic euclidean TSP - (organizing company party) |
--- | --- | --- |
| 13 | W 10/11 | review | --- | --- | --- |
| 14 | M 10/16 | --- Midterm --- | --- | --- | --- |
| 15 | W 10/18 |
Handout: Recursion Trees REC |
hw06-rec.doc hw06-rec-sol.pdf |
Th 10/19 | W 10/25 |
| 16 | M 10/23 |
Chapter 2: Divide-and-Conquer DC1 |
--- | --- | --- |
| 17 | W 10/25 | DC2 | hw07-rec.doc | W 10/25 | W 11/1 |
| 18 | M 10/30 |
Lower bounds: Sections 7.3, 7.8, 8.1, 8.5 LB1 |
--- | --- | --- |
| 19 | W 11/1 | LB2 | hw08-LB.doc hw08-LB-sol.doc hw08-LB-sol.ppt |
Th 11/2 | W 11/8 |
| 20 | M 11/6 |
LB3 - lower bound for finding min - lower bound for finding both min and max - lower bound for merging 2 sorted lists |
--- | --- | --- |
| 21 | W 11/8 |
Theory of NP, Reductions: Sections 9.1-9.4
RD1 |
hw09-LB-reduction.doc hw09-LB-reduction-sol.doc |
W 11/8 | W 11/15 |
| 22 | M 11/13 | RD2 | --- | --- | --- |
| 23 | W 11/15 | RD3 |
hw10-reduction.doc hw10-reduction-sol.doc |
F 11/17 | W 11/29 |
| 24 | M 11/20 | RD4/RD5 | --- | --- | --- |
| - | W 11/22 | --- Thanksgiving. No class. --- | --- | --- | --- |
| 25 | M 11/27 |
Approximation algorithms: Section 9.5 APX1 |
--- | --- | --- |
| 26 | W 11/29 | APX2 | hw11-reduction.doc hw11-reduction-sol.doc |
Th 11/30 | W 12/6 |
| 27 | M 12/4 | APX3 | --- | --- | --- |
| 28 | W 12/6 | review | --- | --- | --- |
| final | F 12/15 | --- Final Exam --- Friday December 15th. 4:00pm-5:50pm. | --- | --- | --- |
|
Class |
Date |
Topics/Info |
Homework | HW assign date | HW due date |