MATH 447 - Combinatorial Analysis

An introduction to the theory and techniques of discrete enumeration, combinatorial designs, and existence theorems with applications drawn from computer science, the physical sciences, information theory, electrical engineering, and various areas of mathematics.

Prerequisite: Grade of ‘C’ or better in MATH 347 - Discrete Mathematics.
Credit(s): 3
Course Attribute(s):

Honors Scholar Course.