|
Sep 14, 2024
|
|
|
|
MATH 305 - Discrete Mathematics Description: Algorithm analysis: recursion, complexity; combinatorics: recurrence relations, dynamic systems, counting techniques; graph theory: Eulerian and Hamiltonian graphs, algorithms and heuristics, planar graphs, trees, applications.
Prerequisites: MATH 230
General Education Designation(s): Associate: CCT
Typically Offered on the Main Campus: Occasionally
3 cr.
Add to Portfolio (opens a new window)
|
|