Spring 2011
[Main Page] [Assignments]
Topics |
Date(s) |
Reading |
|
Introduction to running times and the analysis of algorithms Divide and conquer algorithms If you need to, you should review:
Mon, Jan 10 to Mon, Jan 31
| [CLRS] Chapters 2 and 4 (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) |
Friday, Feb 4 to Monday, Feb 28 |
[CLRS] Chapters 22-25 and 18-21
|
| Midterm 1 |
Wednesday, March 2
|
It will cover [CLRS] Chapters 2-4, 22-25 and 18-21 |
|
Greedy Algorithms Dynamic Programming NP-Completeness, reductions |
Friday, Mar 4 to Friday, April 8 |
[CLRS] Chapters 15, 16 and 34
|
| Midterm 2 |
Wednesday, April 20
|
It will cover [CLRS] Chapters 15, 16 and 34 |
|
NP-completeness continued
Coping with NP-completeness TBD: perhaps randomized algorithms and/or RSA and cryptography |
Fri, Apr 15 to Fri, Apr 29 |
[CLRS] Chapters 35 and ? |