![]() | The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes. Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
MATH 3012 - Applied Combinatorics |
Elementary combinatorial techniques used in discrete problem solving: counting methods, solving linear recurrences, graph and network models, related algorithms, and combinatorial designs.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP All Sections for this Course Sch/Mathematics Department Course Attributes: Tech Elect CS, Engr, &Sciences |
![]() |