ELEE 2110U – Discrete Mathematics for Engineers

Sets and set operations, propositional logic, predicate logic, rules of inference; methods of proof and reasoning, modular arithmetic, counting, pigeonhole 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
Prerequisite(s): MATH 1850U, MATH 1020U
Credit restriction(s): MATH 2080U