Discrete math and algorithms
Requirements effective Autumn Quarter 2001.
Click here for old requirements
This Option gives students a broad background in mathematics and computation with special emphasis on discrete mathematics and its application to optimization and algorithm design. It is particularly well suited for students interested in mathematical aspects of Computer Science, or who wish to pursue a double major in this direction.
Students in the DMA or SCNA pathway can substitute Stat 391 for Math/Stat 390.
Option Core (33 credits or 24 credits)
121, 122, 123 (5,5,5)
- MATH/STAT 300: (3) Mathematical Reasoning
- MATH/STAT 394: (3) Probability I
- CSE 373: (3) Data Structures and Algorithms
- CSE 417: (3) Algorithms and Complexity
- Two of the following:
- MATH/STAT 394: (3) Probability
- CSE 421: (3) Introduction to Algorithms
- CSE 431: (3) Introduction to Theory of Computation
Option Electives -- Group I (9-14 credits)
Three of the following courses. At least two courses must be taken in the MATH department:
- MATH 461: (3) Combinatorial Theory I
- MATH 462: (3) Combinatorial Theory II
- MATH 407: (3) Linear Optimization
- MATH 408: (3) Nonlinear Optimization
- MATH 409: (3) Discrete Optimization
481: (5) Scientific Computing
482: (5) Computational Methods for Data Analysis
483: (5) High-Performance Scientific Computing
Option Electives -- Group II (5 credits or 14 credits)
At least 5 additional credits (14 additional credits for CSE (double) majors) from approved courses (at the 300 level or higher) in the Departments of Applied Mathematics, Computer Science and Engineering, Mathematics and Statistics. The courses listed above in Group I are particularly recommended.
Double majors / Double degrees: Students who complete a double major or double degree with CS or CE will have to take additional courses in the CSE department as required for that major. These credits may be counted toward the Group II electives.