Link to the University of Waterloo home page
2019-2020

The Undergraduate Calendar

 

 

Combinatorics and Optimization

Degree Requirements

Combinatorics and Optimization

Students in this plan must fulfil all the requirements in Table I and Table II. This must include at least 26 math courses, and the following specific requirements:

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

CO 330 Combinatorial Enumeration
CO 342 Introduction to Graph Theory

One of

CO 351 Network Flow Theory
CO 353 Computational Discrete Optimization
CO 367 Nonlinear Optimization
(If CO 255 is taken, this requirement can be satisfied by taking one of CO 450 to CO 471.)

Three additional courses chosen from

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 to CO 487, excluding CO 480

All of

PMATH 336 Introduction to Group Theory with Applications or PMATH 347 Groups and Rings
Three of
MATH 237 Calculus 3 for Honours Mathematics or MATH 247 Calculus 3 (Advanced Level)
AMATH 331/PMATH 331 Applied Real Analysis
AMATH 332/PMATH 332 Applied Complex Analysis
CS 462 Formal Languages and Parsing
CS 466 Algorithm Design and Analysis
CS 487 Introduction to Symbolic Computation
PMATH 334 Introduction to Rings and Fields with Applications or PMATH 348 Fields and Galois Theory
PMATH 340 Elementary Number Theory
Note: These fourth-year CS courses are open only to CS majors.

Two additional 300- or 400-level math courses with a course prefix other than CO.

One additional 300- or 400-level math course.

Three additional math courses.

 


Office of the Registrar
University of Waterloo
2nd Floor, Ira G. Needles Hall
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4567