Combinatorics is the study of discrete structures and their properties. Many modern scientific advances have employed combinatorial structures to model the physical world, and recent advances in computational technology have made such investigations feasible. In particular, since computers process discrete data, combinatorics has become indispensable to computer science.
Optimization, or mathematical programming, is the study of maximizing and minimizing functions subject to specified boundary conditions or constraints. With the emergence of computers, optimization experienced a dramatic growth as a mathematical theory, enhancing both combinatorics and classical analysis. The functions to be optimized arise in engineering, the physical and management sciences, and in various branches of mathematics.
The honours plan combines courses in both combinatorics and optimization, giving students a strong mathematical foundation in both areas. This plan provides students with a great deal of flexibility in selecting courses, allowing students to strengthen their expertise in an area of their choosing.
Our alumni have found employment opportunities across a wide range of industries, reflecting the wide range of applications of combinatorics and optimization. It spans the spectrum from National Defense to Disney World. Industries where our students are currently employed include:
- Finance and banking
- Software and hardware
- National Defense and government services
- Academia and Secondary education
- Engineering firms
- Oil and gas
- Retail and hospitality services
Many of our undergraduate students pursue graduate degrees. For more information on our graduate programs, visit our graduate students page.
The following is the official calendar description of the requirements for completing the Combinatorics and Optimization honours degree.
For your convenience, the following is a checklist for the most recent calendar year.