Sample syllabi

This page contains recent syllabuses and course notes for selected undergraduate Combinatorics and Optimization (CO) courses. These are here to give students a general idea about the course material and the course requirements. Specific requirements will change from term to term.

200 level courses


 

Code Name
CO 227 Introduction to Optimization (Non-Specialist Level)
CO 250 Introduction to Optimization
CO 255 Introduction to Optimization (Advanced Level)

CO 250 can be substituted for CO 255 in both the Combinatorics and Optimization and Math Opt requirements. Moreover, CO 255 allows students to take many of the 400 level courses without additional prerequisite. CO 255 is set at a faster pace than CO 250, is more theoretical and requires a higher level of mathematical maturity. Students with low grades are discouraged to enroll in CO 255.

300 level courses

Code Name Sample syllabus
CO 327 Deterministic OR Models (Non-Specialist Level) N/A
CO 330 Combinatorial Enumeration N/A
CO 331 Coding Theory Winter 2023 (PDF)
CO 342 Introduction to Graph Theory N/A
CO 351 Network Flow Theory N/A
CO 353 Computational Discrete Optimization N/A
CO 367 Nonlinear Optimization N/A
CO 370 Deterministic OR Models N/A
CO 372 Portfolio Optimization Models N/A
CO 380 Mathematical Discovery and Invention N/A

400 level courses

The courses marked with an asterisk (*) are courses that are held in conjunction with graduate courses. The course material will be set at a pace that is appropriate for a graduate course, hence at a much higher level than other undergraduate courses. However, the undergraduate students will be evaluated separately from the graduate students (i.e. will have different exams and different assignments). Students that are interested in applying to graduate school may want to consider taking some of these courses.

Code Name
CO 430* Algebraic Enumeration
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 480 History of Mathematics
CO 481 Introduction to Quantum Information Processing
CO 485* The Mathematics of Public-Key Cryptography
CO 487 Applied Cryptography
CO 499 Reading in Combinatorics and Optimization