Discrete Mathematics I
— MATH 151 (3)
An introduction to discrete mathematics. In contrast to calculus, discrete mathematics deals with structures consisting of distinct, disconnected parts. The nature of discrete math makes it ideally suited to (but not limited to) application in computer science. Discrete math is an extensive field. Topics will include Boolean algebra, elemental set theory, induction, relations and counting, functions, probability and graph theory. Attention will also be paid to the notions of proof and counterexample. This course is a good opportunity to sharpen your analytical skills and develop your ability to prove theorems. Prerequisite: Any 4U or OAC Mathematics.
View all Undergraduate Courses | View Course Schedules