Discrete Mathematics

3 credits · Undergraduate

Elementary combinatorics including permutations and combinations, the principle of inclusion and exclusion, and recurrence relations. Graph theory including Eulerian and Hamiltonian graphs, trees, planarity, coloring, connectivity, network flows, some algorithms and their complexity. Selected topics from computer science and operations research. Prerequisite: 2501, 2600, or all of 2100, 2300, and 2410. [3] (MNS)