Computer Science (COMP)
School of Computer Science
Faculty of Science
COMP 3805 [0.5 credit]
Discrete Structures and Applications (Honours)
Enumeration: inclusion and exclusion, recurrence relations, generating functions and applications. Graph theory: connectivity, planarity, Hamilton and Euler trails. Error-correcting codes. Designs and finite geometries. Symmetry and counting. (Also listed as
MATH 3855.)
Prerequisites: one of
MATH 2108 or
MATH 3101,
MATH 2100.
Lectures three hours a week and one hour tutorial.