Class Schedule Detail

2012 Spring - MATH
Subj Cat# Class# Sect Course
MATH 389 3197 1 Discrete Mathematical Modeling
Discrete mathematics deals with countable quantities. The techniques used for discrete models often differ significantly from those used for continuous models. This course explores some of the main techniques and problems that arise in discrete mathematical modeling. Topics include combinatorial analysis, Markov chains, graph theory, optimization, algorithmic behavior and phase transitions in random combinatorics. The goal is for students to acquire sufficient skills to solve real-world problems requiring discrete mathematical models. Prerequisite: Probability and linear algebra. A previous course in discrete mathematics would be helpful.

2014 Claremont Graduate University 150 E. 10th St., Claremont, CA 91711 (909) 621-8000 Campus Safety Emergency Info Campus Map/Directions Give us feedback