REQUIRED TEXT: Kleinberg and Tardos, Algorithm Design, Addison Wesley

REFERENCE TEXT: Cormen, Leiserson, Rivest, & Stein, Introduction to Algorithms, McGraw-Hill

COURSE COORDINATOR: Jason Hartline

PREREQUISITES: EECS 212 (formerly EECS 310) and EECS 214 (formerly EECS 311)

HOMEWORK ASSIGNMENTS: There will be weekly reading assignments and weekly problem sets.

GRADES:

  • Problem sets – 60%
  • Midterm – 10%
  • Final exam – 30%

more news