CO 220Introductory Combinatorics
- Faculty
- Mathematics
- Last listed
- 1994–95
No longer offered. It’s in Waterloo’s scanned calendars from 1982–83 to 1994–95; the 1995–96 to 2023–24 calendars are on ucalendar.
Elementary principles of enumeration. Principle of inclusion-exclusion, generating functions, recurrence equations. Elementary graph theory and graphical algorithms. Introduction to design theory. C&O 220 cannot be counted for credit toward a BMath Honours degree.
As printed in the 1982–83 to 1994–95 calendars, read by OCR; the scanned page is the original. Later calendars (1995–96 on) aren’t on uwloo.
Requirements, as last listed
Antireq: C&O 230
Check it elsewhere
- Undergraduate Calendar, 1995–96If it ran past 1994–95, on ucalendar
- Course outlinesSyllabi from past terms (UW login)
- UW FlowStudent ratings and reviews
- WClassesPast sections back to 2004, and who taught them
In the scanned calendars
How it read in each calendar from 1982–83 to 1994–95, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1982–83 to 1994–95 12 calendars
Elementary principles of enumeration. Principle of inclusion-exclusion, generating functions, recurrence equations. Elementary graph theory and graphical algorithms. Introduction to design theory.
C&O 220 cannot be counted for credit toward a BMath Honours degree.
Antireq: C&O 230