EXAM INFORMATION CSI2101 Winter 2009

OFFICE HOURS WITH Prof Lucia Moura (STE5027)
Tuesday   April 14 12:00-1:00
Wednesday April 15 1:00-2:15

DISTRIBUTION OF COVERAGE (APPROXIMATE):
20-25% Induction (weak, strong and structural induction)
20-25% Solving Recurrence Relations
30-35% Number Theory and Graph Theory
25% Complexity of Algorithms, Asymptotic notation (big-Oh, etc)
    and Program Correctness and Verification
5% other topics

CLOSED BOOK
Your are responsible for knowing the appropriate methods, theorems
and algorithms in order to solve the questions.
The only exception is that we will list the
RECURRENCE RELATION THEOREMS.

NO CALCULATORS
The numbers and calculations required in the exam are
easy, so the lack of a calculator will not be an issue.