Lecture 14: Review
The following are topics for prelim 1:
- Stable matching
- Basic algorithms analysis
- Graphs
- Greedy algorithms
- Divide and conquer
- Dynamic programming
There will be 1-2 algorithms questions, and then some short answer questions about specific topics (Prim’s, Dijkstra’s).
| This entry was posted on Wednesday, February 23rd, 2005 at 11:20 pm and is tagged with analysis graphs, dynamic programming, dijkstra, short answer, answer questions. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback. |
Leave a Reply
