Description
Enumeration: elementary methods, inclusion and exclusion, recurrence relations, generating functions and applications. Graph theory and algorithms: connectivity, planarity, Hamilton paths and Euler trails. Error-correcting codes.
Prerequisites
- Prerequisite(s): MATH 2108 or MATH 3101 .
Conditions and arrangements
- Precludes additional credit for Precludes additional credit for MATH 3805 (no longer offered), and MATH 3855 and COMP 3805 .
- Prerequisite(s): MATH 2108 or MATH 3101 .
- Lectures three hours a week, tutorial one hour a week.
Reference text in its original language
Enumeration: elementary methods, inclusion and exclusion, recurrence relations, generating functions and applications. Graph theory and algorithms: connectivity, planarity, Hamilton paths and Euler trails. Error-correcting codes.
- Prerequisite(s): MATH 2108 or MATH 3101 .
- Precludes additional credit for Precludes additional credit for MATH 3805 (no longer offered), and MATH 3855 and COMP 3805 .
- Lectures three hours a week, tutorial one hour a week.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/