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