Modern Mathematics: Discrete Methods
Lecture
Main Campus
Course Description
Third part of a proof-based sequence in discrete mathematics, though independent of the second part (62DM). The first half of the quarter gives a brisk-paced coverage of probability and random processes with an intensive use of generating functions and a rich variety of applications. The second half treats entropy, Bayesian inference, Markov chains, game theory, probabilistic methods in solving non-probabilistic problems. We use continuous calculus, e.g. in handling the Gaussian, but anything needed will be reviewed in a self-contained manner. Prerequisite: Math 61DM or 61CM
MATH 63DM
Units: 5
See When It's Offered opens a new window opens in a new tab
Typically Offered
Not Available
Grading Basis
Letter (ABCD/NP)
Class Level
Undergraduate
Instructional Mode
In Person
Gen Ed Requirement(s)
WAYS - Formal Reasoning (FR)
