| |
Apr 03, 2025
|
|
|
|
|
Fall 2025 Undergraduate Catalog
|
AMS 301 - Finite Mathematical Structures
An introduction to graph theory and combinatorial analysis. The emphasis is on solving applied problems rather than on theorems and proofs. Techniques used in problem solving include generating functions, recurrence relations, and network flows. This course develops the type of mathematical thinking that is fundamental to computer science and operations research.
3 credits
Prerequisite(s): AMS 210 or MAT 211 or AMS 361 or MAT 303
SBC: STEM+
|
|