This course is concerned with the finite processes and sets of elements that can be listed. It covers the basics of discrete mathematics including propositional logic, proof techniques, fundamentals of counting, sets, relations, functions, trees, graphs and Boolean algebra.
Prerequisites
MATH110N or MATH115N.