See Bachelor of Computer Science and Bachelor of Mathematics Academic Plan Combinations for a description of joint academic plan requirements. Note: Both majors designated in such joint plans must be disciplines within the Faculty of Mathematics.
- One of
- MATH 239 Introduction to Combinatorics
- MATH 249 Introduction to Combinatorics (Advanced Level)
- One of
- CO 250 Introduction to Optimization
- CO 255 Introduction to Optimization (Advanced Level)
- One of
- Four of
- CO 330 Combinatorial Enumeration
- CO 331 Coding Theory
- CO 342 Introduction to Graph Theory
- CO 351 Network Flow Theory
- CO 353 Computational Discrete Optimization
- CO 367 Nonlinear Optimization
- CO 430 Algebraic Enumeration
- CO 431 Symmetric Functions
- CO 432 Information Theory and Applications
- CO 434 Combinatorial Designs
- CO 439 Topics in Combinatorics
- CO 440 Topics in Graph Theory
- CO 442 Graph Theory
- CO 444 Algebraic Graph Theory
- CO 446 Matroid Theory
- CO 450 Combinatorial Optimization
- CO 452 Integer Programming
- CO 454 Scheduling
- CO 456 Introduction to Game Theory
- CO 459 Topics in Optimization
- CO 463 Convex Optimization and Analysis
- CO 466 Continuous Optimization
- CO 471 Semidefinite Optimization
- CO 481/CS 467/PHYS 467 Introduction to Quantum Information Processing
- CO 485 The Mathematics of Public-Key Cryptography
- CO 486 Topics in Quantum Information
- CO 487 Applied Cryptography
- Three of