When: Tuesday, November 8, regular time, 13:30 - 14:20
Where: regular place, BLU 9660
Duration: 50 minutes, regular class
What's included: `theory' questions (definitions, theorems, etc.)
on Greedy Algorithms, Divide and Conquer, Dynamic Programming, Network Flows,
and Linear Programming.
Problems to solve on the same topics (problems from HW1 -- HW4).
More you can learn from a sample midterm posted on the course webpage.
What do you need to have with you?: Only a pen or pencil.
Course Texts:
"Algorithm Design" by Jon Kleinberg and Eva Tardos, Addison Wesley, 2005
"Introduction to Algorithms" by T. Cormen, C. Leiserson, R. Rivest, C. Stein, McGraw Hill, MIT Press
References:  
Instructor: Andrei Bulatov (abulatov@sfu.ca), Office: TASC 8013
TA: