Print and PDF Options

MATH 3825 [0.5 credit] Discrete Structures and Applications

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.
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.