CSM 3770 - Combinatorial Computing.

(3-0-3) S. Enumeration and counting– generating functions and recurrence relations; graph theory– trees, circuits, outsets, transport networks; computational aspects of combinatorics.

Prerequisites & Notes:
A grade of “C” or better in MAT 2345 and CSM 2170.

Credits: 3