|
Oct 06, 2024
|
|
|
|
MAT 270 Discrete Mathematics The course will cover counting, permutations, combinations, discrete probability distributions, generating functions, Ramsey Theory, the pigeonhole principle, induction, various algorithms, topics in graph theory including: connectivity, trees, Euler tours, Hamilton cycles, edge and vertex coloring, planar graphs and graph algorithms. Prerequisite(s): MAT 145 . 3 hour(s).
Add to Portfolio (opens a new window)
|
|