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 | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE A1
(51330) |
115 |
2026-09-01 - 2026-12-08 (MWF)
12:00 - 12:50
|
|
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE Q1
(77496) |
105 |
2027-01-04 - 2027-04-09 (MWF)
10:00 - 10:50
|
|