CS 515
|
|
Date |
Topics |
Required Reading |
Announcements/Notes |
| Sept. 24 |
Proof Techniques, |
HW Ch. 1: 1, 2, 6, 7 Due October 3 |
|
|
Sept. 26 |
Stable Matching Problem |
Sect. 1.1-1.2 | |
|
Sept. 28 |
Asymptotic Notation |
Sect. 2.1-2.5 |
|
|
Oct. 1 |
cont. |
||
|
Oct. 3 |
Data Structures, Graphs |
Sec. 3.1 |
HW Ch. 2: 3, 4, 5, 6, 8 Ch. 3: 4, 5, 6 Due October 12 |
|
Oct. 5 |
Graphs: BFS, DFS, Testing
Bipartiteness |
Sec. 3.2-3.6 |
|
|
Oct. 8 |
Greedy Algorithms: Topological
Sorting, Interval Scheduling |
Sec. 4.1-4.4 |
|
|
Oct. 10 |
cont. Interval Scheduling |
||
|
Oct. 12 |
Minimum Spanning Trees |
Sec. 4.5 |
HW Ch. 3: 10 Ch. 4: 3, 5, 19, 26 Due: Oct. 22 |
|
Oct. 15 |
Union-Find |
Sec. 4.6 |
|
|
Oct. 17 |
Huffman Codes |
Sec. 4.8 |
|
|
Oct. 19 |
No Class |
||
|
Oct. 22 |
Divide-and-Conquer |
Sec. 5.1-5.5 |
HW Ch. 5: 2,3 Due: Oct. 29 |
|
Oct. 24 |
cont. Divide-and-Conquer, Dynamic
Programming |
Sec. 6.1-6.6, 6.8 |
|
|
Oct. 26 |
Dynamic Programming |
||
|
Oct. 29 |
Dynamic Programming |
||
|
Oct. 31 |
Midterm
Exam |
||
|
Nov. 2 |
Decision Problems and Reductions |
8.1-8.2 |
HW Ch. 6: 1, 3, 6, 7 Due: Nov. 9 |
|
Nov. 5 |
Reductions and Complexity Classes |
||
|
Nov. 7 |
NP and Circuit-SAT |
8.3-8.4 |
|
|
Nov. 9 |
NP-Completeness cont. |
8.5-8.8 |
HW Ch. 8: 4, 8, 10, 11 Due: Nov. 16 |
|
Nov. 12 |
NP-Completeness cont. |
||
|
Nov. 14 |
coNP vs. NP, PSPACE |
8.9 |
|
|
Nov. 16 |
PSPACE-completeness |
9.1-9.5 |
|
|
Nov. 19 |
PSPACE-complete cont., Approximation Algorithms |
||
|
Nov. 21 |
Approximation Algorithms Makespan minimization |
11.1 |
HW Ch. 9: 1, 3 Ch. 11: 1, 3 Due: Nov. 30 |
|
Nov. 23 |
Thanksgiving Break |
||
|
Nov. 26 |
cont. Makespan min., Center selection problem |
11.2 |
|
|
Nov. 28 |
cont. Center Selection, Linear Programming |
11.6 |
|
|
Dec. 30 |
Approximation via Linear Programming |
11.8 |
|
| Dec. 7 |
Final
Exam |
7:30am |
.