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.
Credits: 3 hours
NOTE: Honors Scholar Course.
NOTE: This course counts toward the 63-hour Liberal Arts and Sciences (LAS) graduation requirement.