Questions;

• How the run time of a divide and conquer algorithm can be expressed as a recurrence.

• What the Master Theorem is.

• How to solve recurrences using the Master Theorem.

• What a loop invariant is.

• How to prove an algorithm correct using a loop invariant.

• The three parts of such a proof: initialization, maintenance, termination.

• What a backtracking algorithm is.

• The parts of a backtracking algorithm: base case, make a decision, explore the decision, unmake the decision.

• What continuation passing is.