Spring 2011
[Main Page] [Assignments]
Topics |
Date(s) |
Reading |
|
Introduction to running times and the analysis of algorithms Divide and conquer algorithms Number theoric algorithms and RSA If you need to, you should review:
Mon, Jan 10 to Mon, Jan 31
| [CLRS] Chapters 2, 4 and 31 (and 3 for review)
| |
|
Graph algorithms: DFS, topological sorting, strongly connected components BFS, Shortest paths and Dijkstra's Algorithm, Min-Heaps Minimum Spanning Trees (MST) Max flow |
Friday, Feb 4 to Monday, Feb 28 |
[CLRS] Chapters 22-26 and 18-21
|
| Midterm 1 |
Wednesday, March 2
|
It will cover [CLRS] Chapters 2-4, 31, 22-26 and 18-21 |
|
Greedy Algorithms Dynamic Programming Linear Programming |
Friday, Mar 4 to Fri, Mar 25 |
[CLRS] Chapters 15, 16 and 29
|
|
NP-completeness, reductions
Coping with NP-completeness Randomized algorithms |
Mon, March 28 to Mon, Apr 11 |
[CLRS] Chapters 34, 35 and 5 |
| Midterm 2 |
Wednesday, April 20
|
It will cover [CLRS] Chapters 15, 16, 29, 34 |
|
Approximation Algoirthms Computational Geometry | Fri, Apr 21 to Fri, Apr 29 |