Print Settings
 

CME 305: Discrete Mathematics and Algorithms (MS&E 316)

Topics: enumeration such as Cayley's theorem and Prufer codes, SDR, flows and cuts (deterministic and randomized algorithms), probabilistic methods and random graphs, asymptotics (NP-hardness and approximation algorithms). Topics illustrated with EE, CS, and bioinformatics applications. Prerequisites: CME100 or MATH 51 or equivalents.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: ; Bosagh Zadeh, R. (PI)

MATH 118: Mathematics of Computation

Notions of analysis and algorithms central to modern scientific computing: continuous and discrete Fourier expansions, the fast Fourier transform, orthogonal polynomials, interpolation, quadrature, numerical differentiation, analysis and discretization of initial-value and boundary-value ODE, finite and spectral elements. Prerequisites: MATH 51 and 53.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-Math | Grading: Letter or Credit/No Credit
Instructors: ; Ying, L. (PI)

MS&E 316: Discrete Mathematics and Algorithms (CME 305)

Topics: enumeration such as Cayley's theorem and Prufer codes, SDR, flows and cuts (deterministic and randomized algorithms), probabilistic methods and random graphs, asymptotics (NP-hardness and approximation algorithms). Topics illustrated with EE, CS, and bioinformatics applications. Prerequisites: CME100 or MATH 51 or equivalents.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: ; Bosagh Zadeh, R. (PI)
© Stanford University | Terms of Use | Copyright Complaints