COMS 482: unofficial class blog


Lecture 14: Review

Posted in Class Notes by Elliott Back on February 23rd, 2005. [Del.icio.us]

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 , , , , . You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback.

Leave a Reply

Please take time to enjoy the archives: May 2005 (1) April 2005 (11) March 2005 (11) February 2005 (15) January 2005 (7)

Fresh, related resources:

Supplied by Google Blog Search