Discrete structures and applications. Proofs, with a focus on induction. Prepositional and predicate logic, functions, relations and sets, algorithm analysis, counting techniques, recursion and solution or recurrence relations, graph theory and trees.

• Teacher: Mark Stevens