### Temporal Information

The final will start on
**Monday December 13**^{th} at
**8:00** and end on **Friday December
17**^{th} at **noon**.

### Physical Information

Our final is being held on
**TopHat**.

### Topical Information

This test should allow you to show your mastery of the basic ideas behind
all of the Discrete Mathematics that we have covered.
To refresh your memory, this included the following topics:

- Set Theory.
- Propositional Logic.
- Boolean Algebra.
- Predicate Logic.
- Proof Techniques.
- Number Theory.
- Induction.
- Algorithm Expression.
- Algorithm Efficiency.
- Permutations & Combinations.
- Combinatorial Proof.
- Pigeon Hole Principle.
- Inclusion-Exclusion Principle.
- Recursive Algorithms.
- Recurrence Relations.
- Efficiency of Recursive Algorithms.
- Graph Concepts & Terminology.
- Graph Connectivity & Adjacency.
- Euler & Hamilton & Their Graph Contributions.
- Representing Graphs and Graph Isomorphism.
- Graph Planarity.
- Euler's Formula and Polyhedra.
- Chromatic Number of a Graph.
- Directed Graphs.
- Weighted Graphs.
- Tree Terminology & Statistics.
- Tree Traversals.
- Spanning Trees.
- Functions & Relations.
- Equivalence Relations.
- Partially Ordered Sets.
- n-ary Relations.

Bonus questions might also come from:

- Discrete Probability.
- Generating Functions.
- Partitions of Integers.
- Stirling Numbers of the 2
^{nd} Kind.
- Occupancy Problems.