Print Settings

MATH 63DM: Modern Mathematics: Discrete Methods

Third part of a proof-based sequence in discrete mathematics. The first half of the quarter gives a fast-paced coverage of probability and random processes with an intensive use of generating functions. The second half treats entropy, Shannon¿s coding theorem, game theory, probabilistic methods in solving non-probabilistic problems; some of these topics may vary from year to year. nnPrerequisite: Math 61DM or 61CM
Terms: Spr | Units: 5 | UG Reqs: WAY-FR | Grading: Letter (ABCD/NP)
Instructors: ; Tokieda, T. (PI)
© Stanford University | Terms of Use | Copyright Complaints