MS&E316
Discrete Mathematics and Algorithms
Management Science and Engineering
ENGR - School of Engineering
Course Description
Introduction to theoretical foundations of discrete mathematics and algorithms. Emphasis on providing mathematical tools for combinatorial optimization, i.e. how to efficiently optimize over large finite sets and reason about the complexity of such problems. Topics include: graph theory, minimum cut, minimum spanning trees, matroids, maximum flow, non-bipartite matching, NP-hardness, approximation algorithms, spectral graph theory, and Laplacian systems. Prerequisites: CS 161 is highly recommended, although not required.
Cross Listed Courses
Grading Basis
ROP - Letter or Credit/No Credit
Min
3
Max
3
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
Does this course satisfy the University Language Requirement?
No
Programs
MS&E316
is a
completion requirement
for: