This is a tentative schedule for CS2150 for Spring 2006. This is to give you an idea on the coverage and the pace of the course. This schedule is subject to change. Check back regularly for reading assignments, and homework assignments. Other important updates that do not fit here are on the "Updates" page.
|
Class |
Date |
Reading |
Topics |
Notes | Homework | Solutions |
|
1 |
W 1/4 |
ch 3 (ch 1,2) |
Asymptotic notation | Asymptotic notation | ||
| 2 | M 1/9 | - continue on asymptotic notation | HW1: Due W 1/18. 3.1-1 @ 3.1-2 @ 3-3 @ 3-4. Note, I use "@" to separate problems. |
Q3_1-1.pdf Q3_1-2.pdf Q3-3.pdf Q3-4.pdf |
||
| 3 | W 1/11 | Apx A |
Summations - summations - building a heap (sec 6.4) |
Summations | HW2: Due M 1/23. A.1-2 @ A.2-2 @ A-1. |
hw2-key-ideas.pdf A_1-2.pdf A_2-2.pdf |
| - | M 1/16 | --- No class. Martin Luther King Day --- | ||||
| 4 | W 1/18 |
ch 4 (ch 30) |
Divide and Conquer, and recurrences - substitution method - recursion-tree method - divide and conquer algorithm for polynomial multiplication (ch 30) - better divide and conquer algorithm for polynomial multiplication (ch 30) - FFT algorithm for polynomial multiplication (ch 30) |
HW3:
Due W 1/25. 4.1-5 4.1-6 4.2-1. |
4_1-5.pdf
4_1-5-v2.pdf 4_1-6.pdf 4_2-1.pdf
|
|
| 5 | M 1/23 | - Master method | HW4: Due M 1/30. 4-1 b,d,f,h 4-2 4-4 a,d,g,j. |
4-1.pdf 4-2.doc 4-4 ........ |
||
| 6 | W 1/25 | ch 8-9 |
Information theoretic lower bounds - time complexity of a problem - searching lower bound - sorting lower bound - 3n/2 lower bound for computing median (not in CLRS) |
Finding-max-LB.doc | HW5: Due W 2/1. 8.1-3 8-6 c,d. |
8_1-3.doc 8-6.doc |
| 7 | M 1/30 | ch 5,7,9,12 |
Probabilistic Analysis and Randomized Algorithms - Selection in expected linear time, sec 9.2 - Quicksort, sec 7.3-7.4 - Hiring problem, sec 5.1-5.3, 5.4.4 |
HW6: Due M 2/6. 5.2-3 5.2-4 |
5.2-3 answer = 3.5n 5_2-4.pdf |
|
| 8 | W 2/1 |
- Balls and bins: birthday problem, coupon collector, sec 5.4.2, 5.4.1 - Analysis of streaks in Bernoulli trials, sec 5.4.3 - Randomly built search tree, sec 12.4 |
HW7: Due W 2/8 5.2-5 5.4-2 5.4-6 |
5_2-5.pdf 5_4-2.pdf 5_4-6.pdf |
||
| 9 | M 2/6 | ch 16 |
Greedy algorithms - an activity-selection problem - Huffman coding |
greedy-proofs.doc SPT-proof.doc activity-selection.doc |
HW8: Due M 2/13 16.2-4 16.2-7 |
16_2-4.doc 16_2-7.doc |
| 10 | W 2/8 |
- (Matroid) - a task-scheduling problem - Kruskal algorithm for minimum spanning tree |
interval-coloring.doc | HW9: Due W 2/15 16-1 a,c 16-2 b |
16-1.doc 16-2.doc |
|
| 11 | M 2/13 | ch 15 |
Dynamic programming - assembly-line scheduling - matrix chain multiplication - longest common subsequence |
DP-guideline.doc |
HW10: Due 2/20 15-1 15-2 |
15-1.doc 15-2.doc |
| 12 | W 2/15 |
- optimal binary search tree - knapsack - organizing company party (not in CLRS) - making change |
HW11: Due 2/22 15.4-5 15-4 |
15_4-5.doc 15-4.doc |
||
| 13 | M 2/20 |
ch 17 (ch 21) |
Amortized analysis - aggregate analysis - accounting method - stack multipop - binary counter |
HW12: Due 2/27 17.1-3 17.2-1 17.2-2 |
||
| 14 | W 2/22 |
- potential method - dynamic table expansion - table expansion and contraction |
HW13: Due 3/13 (after Spring Recess, but you should
do it to prepare for exam) 17.3-2 17.3-6 |
|||
| 15 | M 2/27 |
(ch 12,13) |
Review for midterm - dynamic order statistics - interval trees |
|||
| 16 | W 3/1 | --- midterm --- | ||||
| - | M 3/6 | --- No class. Spring Recess --- | ||||
| - | W 3/8 | --- No class. Spring Recess --- | ||||
| 17 | M 3/13 | ch 22,23,24 |
Graph algorithms - topological sort |
HW14: Due 3/20 22.3-8 22.3-10 |
||
| 18 | W 3/15 | solution to midterm exam | no homework today | |||
| 19 | M 3/20 |
- strongly connected components |
HW15: Due 3/27 22.4-2 22-2 (a) |
22_4-2.doc | ||
| 20 | W 3/22 |
- Kruskal's algorithm for MST - Prim's algorithm for MST |
HW16: Due 3/29 23.1-5 23-4 |
23_1-5.doc 23-4.doc |
||
| 21 | M 3/27 | - Dijkstra's algorithm for shortest path | HW17: Due 4/3 24.3-4 24.5-2 |
24_3-4.doc | ||
| 22 | W 3/29 | - Bellman-Ford algorithm for shortest path | HW18: Due 4/5 24-1 24-3 |
24-1.pdf 24-3.doc |
||
| 23 | M 4/3 | ch 26 |
Max flow - Ford-Fulkerson method - Edmonds-Karp algorithm - maximum bipartite matching |
HW19: Due 4/10 26.1-7 26.2-8 |
26_2-8.pdf | |
| 24 | W 4/5 | ch 34 |
NP-completeness and reductions - decision problems - NP-completeness - CIRCUIT-SAT <= SAT |
HW20: Due 4/12 26.2-9 26-4 |
26_2-9.doc 26-4.doc |
|
| 25 | M 4/10 |
- SAT <= 3-CNF-SAT - 3-CNF-SAT <= CLIQUE - CLIQUE <= VERTEX-COVER |
HW21: Due 4/17 34.2-1 34.4-6 |
34_4-6.doc | ||
| 26 | W 4/12 |
- VERTEX-COVER <= HAM-CYCLE - HAM-CYCLE <= TSP - 3-SAT <= SUBSET-SUM |
HW22, Due 4/19 34.5-1 34-1 a,b |
34.5-1.doc 34-1.doc |
||
| 27 | M 4/17 | ch 35 |
Approximation algorithms - Vertex cover - Traveling Salesman |
HW23, Due 4/24 35.2-3 35-1 (this is the last homework) |
||
| 28 | W 4/19 |
- Set cover - Subset sum |
-- no homework -- | |||
| final | M 4/24 | --- Final 1 --- | -- no homework -- | |||
| final | W 4/26 | --- Final 2, Prelim --- | -- no homework -- | |||
|
Class |
Date |
Reading |
Topics/Info |
Notes | Homework | Solutions |