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.
| Section | Capacity | Class times |
|---|---|---|
|
LECTURE A1
(30106) |
120 |
2024-05-06 - 2024-06-12 (MTWRF)
08:30 - 09:40
|
| Section | Capacity | Class times |
|---|---|---|
|
LECTURE A1
(47510) |
115 |
2024-09-03 - 2024-12-09 (MWF)
12:00 - 12:50
|
| Section | Capacity | Class times |
|---|---|---|
|
LECTURE Q1
(73106) |
105 |
2025-01-06 - 2025-04-09 (MWF)
10:00 - 10:50
|