CSM 3770 - Combinatorial Computing

Description
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: MAT 2345 or permission of instructor. Credits: 3
Credits
3
Attributes
*
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Spring 2019, Spring 2018
Offered
MWF
Avg. Class Size
22
Avg. Sections
1