INFR 1010U – Discrete Mathematics

This course addresses the following topics: sets and set operations, propositional logic, predicate logic, rules of inference; methods of proof and reasoning, modular arithmetic, counting, pigeon-hole principle, induction, deduction, relations, functions, graphs, graph algorithms, shortest path, trees, combinatorics; applications to cryptosystems, hashing functions, coding.
Credit hours: 3
Lecture hours: 3
Tutorial hours: 1.5