Aug 14, 2020  
2018-2019 Undergraduate Catalog 
    
2018-2019 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

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)