• Office hours 10-11
  • greedy algorithms, asymptotic analysis, graph algorithms, dynamic programming
  • 2 mid terms, 1 final (25%, 25%, 30% )
    • october 2nd
    • november 20th
    • december 7th-13th
    • final exam is comprehensive
    • close book close note
  • 9 or 10 assignments ( 20% )

Textbook

Textbook