Discrete mathematics focuses on structures where the parts are distinct and separated, as contrasted with the continuous structures studied in calculus. This course has a particular focus on graphs and networks.. We will consider paths and cycles, coloring, planar graphs, and trees. We also consider algorithms to find shortest paths, minimum spanning trees, and maximum flows. Credit hours: 4. Prerequisite: MATH 1149 or CSCI 1151.
- Teacher: Marc Ordower