Spring 2009
[Main Page] [Assignments]
Topics |
Date(s) |
Reading |
|
Number Theoretic Algorithms and Cryptography
Divide and conquer algorithms If you need to, you should review:
Wed, Jan 7 to Mon, Feb 9
| [DPV] Chapters 1 and 2 | |
| Quiz 1 |
Friday, February 13
|
It will cover [DPV] Chapter 1 and 2 |
|
DFS, topological sorting, strongly connected components BFS, Shortest paths and Dijkstra's Algorithm, Min-Heaps |
Wednesday, Feb 11 to Friday, Feb 27 |
[DPV] Chapters 3 and 4 |
| Quiz 2 |
Wednesday, March 6
|
It will cover [DPV] Chapters 3 and 4 |
|
Minimum Spanning Trees (MST) Dynamic Programming |
Monday, Mar 2 to Mon, Mar 23 |
[DPV] Chapters 5.1 and 6 |
| Quiz 3 |
Friday, March 27
|
It will cover [DPV] Chapters 5.1, 5.2 and 6 |
|
NP-completeness, reductions
Linear Programming |
Mon, Mar 25 to Mon, Apr 13 |
[DPV] Chapters 7 and 8 (and perhaps part of 9) |
| Quiz 4 |
Friday, April 17
|
It will cover [DPV] Chapters 7 and 8 |
|
TBD: perhaps randomized algorithms |
Fri Apr 13 to Fri, Apr 24 |
|