|
|
|
|
| Computational & Mathematical Engineering |
|
Session dates and times for courses are available in Axess under the Guest Menu. Course day, time, and units are subject to change. Courses are eight weeks long unless otherwise noted in the course description or details.
|
| · |
Introduction to Discrete Mathematics and Algorithms
|
| · |
Introduction to Probability and Statistics for Engineers |
CME 105
Introduction to Discrete Mathematics and Algorithms
3
units
Time: see axess.stanford.edu
Discrete mathematics and algorithms as used in modeling and problem solving technique emphasizing contemporary problems. Topics: introduction to set theory, logic, combinatorics, and graphs theory; formal proof techniques in induction, recursion, and contradiction; algorithms for sorting, shortest paths, minimum spanning trees, and bipartite matching. Applications to Internet advertising, viral marketing, routing, social networks and games of chance.
Note: Background in linear algebra/matrix theory.
|
|
CME 106
Introduction to Probability and Statistics for Engineers
3-4
units
Time: see axess.stanford.edu
Probability: random variables, independence, and conditional probability; discrete and continuous distributions, moments, distributions of several random variables. Topics in mathematical statistics: random sampling, point estimation, confidence intervals, hypothesis testing, non-parametric tests, regression and correlation analyses; applications in engineering, industrial manufacturing, medicine, biology, and other fields.
Prerequisite: CME 100/ENGR 154 or MATH 51.
Note: Meets GER Disciplinary Breadth: Math
|
|
|
|
|
|
