|
Dec 26, 2024
|
|
|
|
MAT 250 - Discrete Mathematics II Prerequisite(s): MAT 150 and MAT 220 with grades of “C-” or better. A continuation of Discrete Mathematics I, with more emphasis on proof. Topics include recursion, recurrence relations, computational complexity, finite-state automata, and more in-depth study of graphs and trees, including algorithms and predicate logic. This course is required for the Theoretical Track in Mathematics and is highly recommended for the BA degree in Computer Science, particularly for those planning on graduate study. Spring
Hours: 3
Add to Portfolio (opens a new window)
|
|