Methods and applications of combinatorial mathematics including graph theory 'matchings, chromatic numbers, planar graphs, independence and clique numbers' and related algorithms, combinatorial designs 'block designs, Latin squares, projective geometries', error correcting codes.

Credit Restriction: Credit may be obtained for only one of Computing Science 421 or Mathematics 421

Prerequisites: Mathematics 120 [C- minimum grade required] and Mathematics 321 [C- minimum grade required] and 2nd year standing required
Corequisites: Academic Integrity Training 100
Further information: Course availability and times