MATH 111 - Introduction to Discrete Mathematics

3 units (fi 6)(EITHER, 3-0-0)

Faculty of Science

A problem-solving approach to discrete mathematics, covering secret codes, public-key codes, error-correcting codes, enumeration, recurrence relations, induction, graph theory, graph algorithms and parallel algorithms. Prerequisite: MATH 30-1, 30-2, or equivalent. Note : Credit can only be obtained in at most one of MATH 111 or MATH 222.

No syllabi

Fall Term 2024

Lectures

Section Capacity Class times Login to view Instructor(s) and Location
LECTURE A1
(47510)
115
2024-09-03 - 2024-12-09 (MWF)
12:00 - 12:50

Winter Term 2025

Lectures

Section Capacity Class times Login to view Instructor(s) and Location
LECTURE Q1
(73106)
105
2025-01-06 - 2025-04-09 (MWF)
10:00 - 10:50