| |
Nov 21, 2024
|
|
|
|
|
MATH 212 - Discrete Mathematics II
3 Credit(s)
Planar graphs, bipartite graphs, Hamiltonian graphs, the graph isomorphism problem, trees, connectivity and spanning trees, formal models of automata, language, and computability and their relationships, finite automata and regular languages, push-down automata, context-free languages and the theorems of Euler and Kuratowski. This course provides more of the discrete portion of the mathematical background needed by students in computer science. This course is offered once a year during the Spring Semester.
Prerequisite(s): MATH 131
Add to Plan of Study (opens a new window)
|
|
