MATH 315 - Discrete Mathematics II

Credit(s): 3

DISCRETE MATHEMATICS II
Component: Lecture
Algorithmic graph theory and computational geometry. Topics in graph theory cover shortest path problems, coloring problems, and others. The computational geometry covers Steiner tree, convex hull, design of experiments and selected topics.
Repeatable for Credit: N Allowed Units: 3 Multiple Term Enrollment: N Grading Basis: Student Option

PREREQ: MATH 210.

Course Typically Offered: Spring

General Education Objectives:
GE1B: Analyze Arguments and Information GE1C: Engage in Constructive Ideation GE2A: Communicate Effectively in Writing GE5A: Reason Quantitatively GE5C: Reason Scientifically