Please note:
To view the Fall 2024 Academic Calendar, go to www.sfu.ca/students/calendar/2024/fall.html.
Operations Research Honours
This program prepares students for careers in industry or a variety of graduate and professional programs.
Prerequisite Grade Requirement
To enroll in a course offered by the Department of Mathematics, a student must obtain a grade of C- or better in each prerequisite course. Some courses may require higher prerequisite grades. Check the MATH course’s Calendar description for details.
Students will not normally be permitted to enroll in any course for which a D grade or lower was obtained in any prerequisite. No student may complete, for further credit, any course offered by the Department of Mathematics which is a prerequisite for a course the student has already completed with a grade of C- or higher, without permission of the department.
Program Requirements
The program requires the completion of 120 units. The Faculty of Science stipulates that a minimum of 48 units must be in upper division, and that additional upper division units will be required to total a minimum of 60.
The specific requirements for this particular program are divided into three parts: required lower division courses, required upper division courses, and completion of an interdisciplinary requirement.
In addition to the program requirements set out below, general university regulations must be met.
A minimum program 3.00 cumulative grade point average (CGPA) must be obtained on the overall major program requirements, as well as a minimum program 3.00 grade point average in the upper division major courses.
Lower Division Requirements
Students complete
both of
An elementary introduction to computing science and computer programming, suitable for students with little or no programming background. Students will learn fundamental concepts and terminology of computing science, acquire elementary skills for programming in a high-level language, e.g. Python. The students will be exposed to diverse fields within, and applications of computing science. Topics will include: pseudocode; data types and control structures; fundamental algorithms; recursion; reading and writing files; measuring performance of algorithms; debugging tools; basic terminal navigation using shell commands. Treatment is informal and programming is presented as a problem-solving tool. Prerequisite: BC Math 12 or equivalent is recommended. Students with credit for CMPT 102, 128, 130 or 166 may not take this course for further credit. Students who have taken CMPT 125, 129, 130 or 135 first may not then take this course for further credit. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Diana Cukierman |
Jan 6 β Apr 9, 2025: Mon, 2:30β4:20 p.m.
Jan 6 β Apr 9, 2025: Wed, 2:30β3:20 p.m. |
Burnaby Burnaby |
|
John Edgar |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Surrey |
|
D201 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 2:30β3:20 p.m.
|
Surrey |
D202 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 2:30β3:20 p.m.
|
Surrey |
D203 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Surrey |
D204 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Surrey |
D205 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 4:30β5:20 p.m.
|
Surrey |
D206 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 4:30β5:20 p.m.
|
Surrey |
D207 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 5:30β6:20 p.m.
|
Surrey |
D208 |
John Edgar |
Jan 6 β Apr 9, 2025: Tue, 5:30β6:20 p.m.
|
Surrey |
A rigorous introduction to computing science and computer programming, suitable for students who already have some background in computing science and programming. Intended for students who will major in computing science or a related program. Topics include: memory management; fundamental algorithms; formally analyzing the running time of algorithms; abstract data types and elementary data structures; object-oriented programming and software design; specification and program correctness; reading and writing files; debugging tools; shell commands. Prerequisite: CMPT 120 or CMPT 130, with a minimum grade of C-. Students with credit for CMPT 126, 129, 135 or CMPT 200 or higher may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Janice Regan |
Jan 6 β Apr 9, 2025: Tue, 10:30 a.m.β12:20 p.m.
Jan 6 β Apr 9, 2025: Fri, 10:30β11:20 a.m. |
Burnaby Burnaby |
|
D101 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 9:30β10:20 a.m.
|
Burnaby |
D102 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 9:30β10:20 a.m.
|
Burnaby |
D103 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 10:30β11:20 a.m.
|
Burnaby |
D104 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 10:30β11:20 a.m.
|
Burnaby |
D105 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 12:30β1:20 p.m.
|
Burnaby |
D106 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 12:30β1:20 p.m.
|
Burnaby |
D107 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 1:30β2:20 p.m.
|
Burnaby |
D108 |
Janice Regan |
Jan 6 β Apr 9, 2025: Mon, 1:30β2:20 p.m.
|
Burnaby |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 3:30β4:20 p.m.
Jan 6 β Apr 9, 2025: Fri, 2:30β4:20 p.m. |
Burnaby Burnaby |
|
D201 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 9:30β10:20 a.m.
|
Burnaby |
D202 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 9:30β10:20 a.m.
|
Burnaby |
D203 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 10:30β11:20 a.m.
|
Burnaby |
D204 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 10:30β11:20 a.m.
|
Burnaby |
D205 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 12:30β1:20 p.m.
|
Burnaby |
D206 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 12:30β1:20 p.m.
|
Burnaby |
D207 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 1:30β2:20 p.m.
|
Burnaby |
D208 |
Janice Regan |
Jan 6 β Apr 9, 2025: Wed, 1:30β2:20 p.m.
|
Burnaby |
(Students transferring into a math program should contact the math undergraduate advisor if they have already completed equivalent courses.)
or both of
An introduction to computing science and computer programming, using a systems oriented language, such as C or C++. This course introduces basic computing science concepts. Topics will include: elementary data types, control structures, functions, arrays and strings, fundamental algorithms, computer organization and memory management. Prerequisite: BC Math 12 (or equivalent, or any of MATH 100, 150, 151, 154, or 157, with a minimum grade of C-). Students with credit for CMPT 102, 120, 128 or 166 may not take this course for further credit. Students who have taken CMPT 125, 129 or 135 first may not then take this course for further credit. Quantitative/Breadth-Science.
A second course in systems-oriented programming and computing science that builds upon the foundation set in CMPT 130 using a systems-oriented language such as C or C++. Topics: a review of the basic elements of programming; introduction to object-oriented programming (OOP); techniques for designing and testing programs; use and implementation of elementary data structures and algorithms; introduction to embedded systems programming. Prerequisite: CMPT 130 with a minimum grade of C-. Students with credit for CMPT 125, 126, or 129 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Harinder Khangura |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Surrey |
|
D101 |
Harinder Khangura |
Jan 6 β Apr 9, 2025: Wed, 1:30β2:20 p.m.
|
Surrey |
D102 |
Harinder Khangura |
Jan 6 β Apr 9, 2025: Thu, 10:30β11:20 a.m.
|
Surrey |
D103 |
Harinder Khangura |
Jan 6 β Apr 9, 2025: Thu, 10:30β11:20 a.m.
|
Surrey |
D104 |
Harinder Khangura |
Jan 6 β Apr 9, 2025: Thu, 11:30 a.m.β12:20 p.m.
|
Surrey |
D105 |
Harinder Khangura |
Jan 6 β Apr 9, 2025: Thu, 11:30 a.m.β12:20 p.m.
|
Surrey |
D106 |
Harinder Khangura |
Jan 6 β Apr 9, 2025: Thu, 12:30β1:20 p.m.
|
Surrey |
and all of
Introduction to a variety of practical and important data structures and methods for implementation and for experimental and analytical evaluation. Topics include: stacks, queues and lists; search trees; hash tables and algorithms; efficient sorting; object-oriented programming; time and space efficiency analysis; and experimental evaluation. Prerequisite: (MACM 101 and (CMPT 125, CMPT 129 or CMPT 135)) or (ENSC 251 and ENSC 252), all with a minimum grade of C-. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
David Mitchell |
Jan 6 β Apr 9, 2025: Tue, 1:30β2:20 p.m.
Jan 6 β Apr 9, 2025: Thu, 12:30β2:20 p.m. |
Burnaby Burnaby |
|
D101 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 8:30β9:20 a.m.
|
Burnaby |
D102 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 8:30β9:20 a.m.
|
Burnaby |
D103 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 9:30β10:20 a.m.
|
Burnaby |
D104 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 9:30β10:20 a.m.
|
Burnaby |
D105 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 10:30β11:20 a.m.
|
Burnaby |
D106 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 10:30β11:20 a.m.
|
Burnaby |
D107 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D108 |
David Mitchell |
Jan 6 β Apr 9, 2025: Thu, 11:30 a.m.β12:20 p.m.
|
Burnaby |
John Edgar |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Surrey |
|
D201 |
John Edgar |
Jan 6 β Apr 9, 2025: Fri, 2:30β3:20 p.m.
|
Surrey |
D202 |
John Edgar |
Jan 6 β Apr 9, 2025: Fri, 2:30β3:20 p.m.
|
Surrey |
D203 |
John Edgar |
Jan 6 β Apr 9, 2025: Fri, 3:30β4:20 p.m.
|
Surrey |
D204 |
John Edgar |
Jan 6 β Apr 9, 2025: Fri, 3:30β4:20 p.m.
|
Surrey |
D205 |
John Edgar |
Jan 6 β Apr 9, 2025: Fri, 4:30β5:20 p.m.
|
Surrey |
D206 |
John Edgar |
Jan 6 β Apr 9, 2025: Fri, 4:30β5:20 p.m.
|
Surrey |
Introduction to graph theory, trees, induction, automata theory, formal reasoning, modular arithmetic. Prerequisite: BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Brad Bart |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
D101 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 2:30β3:20 p.m.
|
Burnaby |
D102 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 2:30β3:20 p.m.
|
Burnaby |
D103 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 3:30β4:20 p.m.
|
Burnaby |
D104 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 3:30β4:20 p.m.
|
Burnaby |
D105 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 4:30β5:20 p.m.
|
Burnaby |
D106 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 4:30β5:20 p.m.
|
Burnaby |
D107 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 5:30β6:20 p.m.
|
Burnaby |
D108 |
Brad Bart |
Jan 6 β Apr 9, 2025: Thu, 5:30β6:20 p.m.
|
Burnaby |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Burnaby |
|
D201 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 2:30β3:20 p.m.
|
Burnaby |
D202 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 2:30β3:20 p.m.
|
Burnaby |
D203 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Burnaby |
D204 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Burnaby |
D205 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 4:30β5:20 p.m.
|
Burnaby |
D206 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 4:30β5:20 p.m.
|
Burnaby |
D207 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 5:30β6:20 p.m.
|
Burnaby |
D208 |
Andrei Bulatov |
Jan 6 β Apr 9, 2025: Tue, 5:30β6:20 p.m.
|
Burnaby |
Victor Cheung |
Jan 6 β Apr 9, 2025: Wed, 3:30β4:20 p.m.
Jan 6 β Apr 9, 2025: Fri, 2:30β4:20 p.m. |
Surrey Surrey |
|
D301 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 2:30β3:20 p.m.
|
Surrey |
D302 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 2:30β3:20 p.m.
|
Surrey |
D303 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 3:30β4:20 p.m.
|
Surrey |
D304 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 3:30β4:20 p.m.
|
Surrey |
D305 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 4:30β5:20 p.m.
|
Surrey |
D306 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 4:30β5:20 p.m.
|
Surrey |
D307 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 5:30β6:20 p.m.
|
Surrey |
D308 |
Victor Cheung |
Jan 6 β Apr 9, 2025: Mon, 5:30β6:20 p.m.
|
Surrey |
A continuation of MACM 101. Topics covered include graph theory, trees, inclusion-exclusion, generating functions, recurrence relations, and optimization and matching. Prerequisite: MACM 101 or (ENSC 251 and one of MATH 232 or MATH 240). Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Petr Lisonek |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Burnaby |
|
Abraham Punnen |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Introduction to methods of operations research: linear and nonlinear programming, simulation, and heuristic methods. Applications to transportation, assignment, scheduling, and game theory. Exposure to mathematical models of industry and technology. Emphasis on computation for analysis and simulation. Prerequisite: MATH 150 or 151 or 154 or 157, with a minimum grade of C-. Students with credit for MATH 208 may not take this course for further credit. Writing/Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Tamon Stephen |
Jan 6 β Apr 9, 2025: Mon, 2:30β4:20 p.m.
Jan 6 β Apr 9, 2025: Wed, 2:30β3:20 p.m. |
Burnaby Burnaby |
|
D101 |
Tamon Stephen |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Burnaby |
Rectangular, cylindrical and spherical coordinates. Vectors, lines, planes, cylinders, quadric surfaces. Vector functions, curves, motion in space. Differential and integral calculus of several variables. Vector fields, line integrals, fundamental theorem for line integrals, Green's theorem. Prerequisite: MATH 152 with a minimum grade of C-; or MATH 158 with a grade of at least B. Also, for students in the life sciences, MATH 154 with a minimum grade of C- and MATH 155 with a minimum grade of A-. Recommended: It is recommended that MATH 240 or 232 be taken before or concurrently with MATH 251. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Lucas Villagra Torcomian |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
OP01 | TBD |
Basic laws of probability, sample distributions. Introduction to statistical inference and applications. Prerequisite: or Corequisite: MATH 152 or 155 or 158, with a minimum grade of C-. Students wishing an intuitive appreciation of a broad range of statistical strategies may wish to take STAT 100 first. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Richard Lockhart |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Burnaby |
|
Jinko Graham |
Online | ||
OP01 | TBD |
This course is a continuation of STAT 270. Review of probability models. Procedures for statistical inference using survey results and experimental data. Statistical model building. Elementary design of experiments. Regression methods. Introduction to categorical data analysis. Prerequisite: STAT 270 and one of MATH 152, MATH 155, or MATH 158, all with a minimum grade of C-. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Liangliang Wang |
Jan 6 β Apr 9, 2025: Mon, 12:30β1:20 p.m.
Jan 6 β Apr 9, 2025: Thu, 12:30β2:20 p.m. |
Burnaby Burnaby |
|
D101 |
Liangliang Wang |
Jan 6 β Apr 9, 2025: Thu, 2:30β3:20 p.m.
|
Burnaby |
D102 |
Liangliang Wang |
Jan 6 β Apr 9, 2025: Thu, 3:30β4:20 p.m.
|
Burnaby |
and one of
Designed for students specializing in mathematics, physics, chemistry, computing science and engineering. Topics as for Math 151 with a more extensive review of functions, their properties and their graphs. Recommended for students with no previous knowledge of Calculus. In addition to regularly scheduled lectures, students enrolled in this course are encouraged to come for assistance to the Calculus Workshop (Burnaby), or Math Open Lab (Surrey). Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B+, or MATH 100 with a grade of at least B-, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 151, 154 or 157 may not take MATH 150 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
||
D101 |
Jan 6 β Apr 9, 2025: Tue, 8:30β9:20 a.m.
|
Burnaby |
|
D102 |
Jan 6 β Apr 9, 2025: Tue, 9:30β10:20 a.m.
|
Burnaby |
|
D105 |
Jan 6 β Apr 9, 2025: Wed, 12:30β1:20 p.m.
|
Burnaby |
|
D106 |
Jan 6 β Apr 9, 2025: Wed, 1:30β2:20 p.m.
|
Burnaby |
|
D107 |
Jan 6 β Apr 9, 2025: Wed, 4:30β5:20 p.m.
|
Burnaby |
|
D108 |
Jan 6 β Apr 9, 2025: Wed, 3:30β4:20 p.m.
|
Burnaby |
|
Vijaykumar Singh |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Surrey |
|
D401 |
Jan 6 β Apr 9, 2025: Wed, 1:30β2:20 p.m.
|
Surrey |
|
D402 |
Jan 6 β Apr 9, 2025: Wed, 2:30β3:20 p.m.
|
Surrey |
|
D403 |
Jan 6 β Apr 9, 2025: Wed, 12:30β1:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Designed for students specializing in mathematics, physics, chemistry, computing science and engineering. Logarithmic and exponential functions, trigonometric functions, inverse functions. Limits, continuity, and derivatives. Techniques of differentiation, including logarithmic and implicit differentiation. The Mean Value Theorem. Applications of differentiation including extrema, curve sketching, Newton's method. Introduction to modeling with differential equations. Polar coordinates, parametric curves. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least A, or MATH 100 with a grade of at least B, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 154 or 157 may not take MATH 151 for further credit. Quantitative.
Designed for students specializing in the life sciences. Topics include: limits, growth rate and the derivative; elementary functions, optimization and approximation methods, and their applications, integration, and differential equations; mathematical models of biological processes and their implementation and analysis using software. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B, or MATH 100 with a grade of at least C-, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 151 or 157 may not take MATH 154 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Ralf Wittenberg |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
OP01 | TBD |
Designed for students specializing in business or the social sciences. Topics include: limits, growth rate and the derivative; logarithmic, exponential and trigonometric functions and their application to business, economics, optimization and approximation methods; introduction to functions of several variables with emphasis on partial derivatives and extrema. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B, or MATH 100 with a grade of at least C, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 151 or 154 may not take MATH 157 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Jonathan Jedwab |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
Randall Pyke |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
and one of
Riemann sum, Fundamental Theorem of Calculus, definite, indefinite and improper integrals, approximate integration, integration techniques, applications of integration. First-order separable differential equations and growth models. Sequences and series, series tests, power series, convergence and applications of power series. Prerequisite: MATH 150 or 151 or 155, with a minimum grade of C-; or MATH 154 or 157, with a grade of at least B. Students with credit for MATH 158 or 251 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Nathan Ilten |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
Jamie Mulholland |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
Seda Albayrak |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
Abraham Punnen |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Designed for students specializing in the life sciences. Topics include: vectors and matrices, partial derivatives, multi-dimensional integrals, systems of differential equations, compartment models, graphs and networks, and their applications to the life sciences; mathematical models of multi-component biological processes and their implementation and analysis using software. Students planning to take MATH 251 are recommended to consider MATH 152 as the prerequisite pathway. See an advisor to determine what may be best for you. Prerequisite: MATH 150, 151 or 154, with a minimum grade of C-; or MATH 157 with a grade of at least B. Students with credit for MATH 152 or 158 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
JF Williams |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 8:30β9:20 a.m.
|
Burnaby |
|
Justin Chan |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Designed for students specializing in business or the social sciences. Topics include: theory of integration, integration techniques, applications of integration; functions of several variables with emphasis on double and triple integrals and their applications; introduction to differential equations with emphasis on some special first-order equations and their applications; sequences and series. Prerequisite: MATH 150 or 151 or 154 or 157, with a minimum grade of C-. Students with credit for MATH 152 or 155 may not take MATH 158 for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Jessica Stockdale |
Jan 6 β Apr 9, 2025: Mon, 4:30β5:20 p.m.
Jan 6 β Apr 9, 2025: Wed, 4:30β6:20 p.m. |
Burnaby Burnaby |
|
OP03 | TBD |
and one of
Linear equations, matrices, determinants. Introduction to vector spaces and linear transformations and bases. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. An emphasis on applications involving matrix and vector calculations. Prerequisite: MATH 150 or 151 or MACM 101, with a minimum grade of C-; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 240 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Luis Goddyn Marni Julie Mishna |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
Saieed Akbari Feyzaabaadi |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
Randall Pyke |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 2:30β3:20 p.m.
|
Surrey |
|
OP01 | TBD | ||
OP02 | TBD |
Linear equations, matrices, determinants. Real and abstract vector spaces, subspaces and linear transformations; basis and change of basis. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. Applications. Subject is presented with an abstract emphasis and includes proofs of the basic theorems. Prerequisite: MATH 150 or 151 or MACM 101, with a minimum grade of C-; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 232 cannot take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Katrina Honigs |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.β12:20 p.m.
|
Burnaby |
|
OP01 | TBD |
* with a B grade or better
Upper Division Requirements
Students complete a total of 48 units, including all of
Linear programming modelling. The simplex method and its variants. Duality theory. Post-optimality analysis. Applications and software. Additional topics may include: game theory, network simplex algorithm, and convex sets. Prerequisite: MATH 150, 151, 154, or 157 and MATH 240 or 232, all with a minimum grade of C-. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Maxwell Levit |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 2:30β3:20 p.m.
|
Burnaby |
|
D101 |
Jan 6 β Apr 9, 2025: Tue, 2:30β3:20 p.m.
|
Burnaby |
|
D102 |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Burnaby |
|
D103 |
Jan 6 β Apr 9, 2025: Tue, 4:30β5:20 p.m.
|
Burnaby |
Modelling of real-life systems as Markov chains, including transient behaviour, limiting behaviour and classification of states, and using the exponential distribution and Poisson processes. Computational topics include generating and sampling random numbers, combinatorial objects and probability functions. Applications may include queueing systems, chemical kinetics, infectious diseases, and statistical physics. Prerequisite: STAT 270 and (MATH 232 or MATH 240), all with a minimum grade of C-. Strongly Recommended: Experience with a computing platform such as R, MATLAB, or Python. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Ailene MacPherson |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 3:30β4:20 p.m.
|
Burnaby |
|
D101 |
Ailene MacPherson |
Jan 6 β Apr 9, 2025: Tue, 3:30β4:20 p.m.
|
Burnaby |
Problems from operations research will be presented and discussed in class. Students will also work on a problem of their choice and present their solution in report form as well as a presentation. Prerequisite: MATH 308 with a minimum grade of C-. Writing/Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Alexander Rutherford |
Jan 6 β Apr 9, 2025: Tue, Thu, 10:30 a.m.β12:20 p.m.
|
Burnaby |
and five of
Theoretical and computational methods for investigating the minimum of a function of several real variables with and without inequality constraints. Applications to operations research, model fitting, and economic theory. Prerequisite: MATH 232 or 240, and 251, all with a minimum grade of C-. Quantitative.
Sequences and series of functions, topology of sets in Euclidean space, introduction to metric spaces, functions of several variables. Prerequisite: MATH 242 and 251, with a minimum grade of C-. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Nilima Nigam |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 1:30β2:20 p.m.
|
Burnaby |
|
D101 |
Nilima Nigam |
Jan 6 β Apr 9, 2025: Thu, 12:30β1:20 p.m.
|
Burnaby |
Model building using integer variables, computer solution, relaxations and lower bounds, heuristics and upper bounds, branch and bound algorithms, cutting plane algorithms, valid inequalities and facets, branch and cut algorithms, Lagrangian duality, column generation of algorithms, heuristics algorithms and analysis. Prerequisite: MATH 308 with a minimum grade of C-. Quantitative.
Theory and application of linear regression. Normal distribution theory. Hypothesis tests and confidence intervals. Model selection. Model diagnostics. Introduction to weighted least squares and generalized linear models. Prerequisite: STAT 260, STAT 285, MATH 251, and one of MATH 232 or MATH 240, all with a minimum grade of C-. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Boxin Tang |
Jan 6 β Apr 9, 2025: Tue, 2:30β4:20 p.m.
Jan 6 β Apr 9, 2025: Thu, 2:30β3:20 p.m. |
Burnaby Burnaby |
|
D101 |
Boxin Tang |
Jan 6 β Apr 9, 2025: Thu, 9:30β10:20 a.m.
|
Burnaby |
D102 |
Boxin Tang |
Jan 6 β Apr 9, 2025: Thu, 10:30β11:20 a.m.
|
Burnaby |
Review of discrete and continuous probability models and relationships between them. Exploration of conditioning and conditional expectation. Markov chains. Random walks. Continuous time processes. Poisson process. Markov processes. Gaussian processes. Prerequisite: STAT 330, or all of: STAT 285, MATH 208W, and MATH 251, all with a minimum grade of C-. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Samopriya Basu |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 9:30β10:20 a.m.
|
Burnaby |
|
D101 |
Samopriya Basu |
Jan 6 β Apr 9, 2025: Wed, 3:30β4:20 p.m.
|
Burnaby |
and at least one of
An introduction to the modelling, analysis, and computer simulation of complex systems. Topics include analytic modelling, discrete event simulation, experimental design, random number generation, and statistical analysis. Prerequisite: CMPT 225, (MACM 101 or (ENSC 251 and ENSC 252)) and (STAT 270 or STAT 271), all with a minimum grade of C-.
Design and analysis of efficient data structures and algorithms. General techniques for building and analyzing algorithms (greedy, divide & conquer, dynamic programming, network flows). Introduction to NP-completeness. Prerequisite: CMPT 225, (MACM 201 or CMPT 210), (MATH 150 or MATH 151), and (MATH 232 or MATH 240), all with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 150 or MATH 151.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Qianping Gu |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Burnaby |
|
Jan 6 β Apr 9, 2025: Mon, 12:30β2:20 p.m.
Jan 6 β Apr 9, 2025: Wed, 12:30β1:20 p.m. |
Surrey Surrey |
A presentation of the problems commonly arising in numerical analysis and scientific computing and the basic methods for their solutions. Prerequisite: MATH 152 or 155 or 158, and MATH 232 or 240, and computing experience. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Steven Ruuth |
Jan 6 β Apr 9, 2025: Mon, Wed, Fri, 12:30β1:20 p.m.
|
Burnaby |
|
D101 |
Steven Ruuth |
Jan 6 β Apr 9, 2025: Wed, 2:30β3:20 p.m.
|
Burnaby |
D102 |
Steven Ruuth |
Jan 6 β Apr 9, 2025: Wed, 3:30β4:20 p.m.
|
Burnaby |
D103 |
Steven Ruuth |
Jan 6 β Apr 9, 2025: Wed, 4:30β5:20 p.m.
|
Burnaby |
D104 |
Steven Ruuth |
Jan 6 β Apr 9, 2025: Thu, 9:30β10:20 a.m.
|
Burnaby |
D105 |
Steven Ruuth |
Jan 6 β Apr 9, 2025: Thu, 10:30β11:20 a.m.
|
Burnaby |
D106 |
Steven Ruuth |
Jan 6 β Apr 9, 2025: Thu, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D107 |
Jan 6 β Apr 9, 2025: Thu, 4:30β5:20 p.m.
|
Burnaby |
Structures and algorithms, generating elementary combinatorial objects, counting (integer partitions, set partitions, Catalan families), backtracking algorithms, branch and bound, heuristic search algorithms. Prerequisite: MACM 201 with a minimum grade of C-. Recommended: Knowledge of a programming language. Quantitative.
Fundamental concepts, trees and distances, matchings and factors, connectivity and paths, network flows, integral flows. Prerequisite: MACM 201 with a minimum grade of C-. Quantitative.
and at least 6 additional units from the following list
The application of econometric techniques to the empirical investigation of economic issues. Prerequisite: ECON 201 and ECON (or BUEC) 333, all with a minimum grade of C-. Entry into this course requires a minimum CGPA of 3.0 or permission of the department. Quantitative.
Any upper division STAT course except for STAT 302, STAT 305, STAT 310, STAT 311, STAT 320, and STAT 403.
To complete the required 48 upper division units, students complete additional coursework, of which at least two courses must be 400-level MATH or MACM courses with the possibility of substituting a 400-level course from another department subject to advisor approval. Courses used to fulfil this upper division requirement cannot be used to satisfy the interdisciplinary requirement. All courses pertaining to the required 48 upper division units must be approved by the program advisor in the Department of Mathematics.
NOTE: Ά‘ΟγΤ°AV students accepted in the accelerated master’s within the Department of Mathematics may apply a maximum of 10 graduate course units, taken while completing the bachelor's degree, towards the upper division electives of the bachelor's program and the requirements of the master's degree. For more information go to: /gradstudies/apply/programs/accelerated-masters.html.
Interdisciplinary Requirement
With advisor approval, students also complete at least 15 units from application areas. Application courses are chosen from ACMA, BUEC, BUS, CMPT, ECON, MACM, MATH, REM and STAT courses. Courses used to fulfil upper division requirements cannot be used to fulfil this requirement. If the operations research honours is completed as part of a second bachelor's degree, then the interdisciplinary requirement may be waived if the previous degree contains an approved major. Approvals are given individually. Those majors that are approved will not be limited to the disciplines listed above.
University Honours Degree Requirements
Students must also satisfy University degree requirements for degree completion.
Writing, Quantitative, and Breadth Requirements
Students admitted to Ά‘ΟγΤ°AV beginning in the fall 2006 term must meet writing, quantitative and breadth requirements as part of any degree program they may undertake. See Writing, Quantitative, and Breadth Requirements for university-wide information.
WQB Graduation Requirements
A grade of C- or better is required to earn W, Q or B credit
Requirement |
Units |
Notes | |
W - Writing |
6 |
Must include at least one upper division course, taken at Ά‘ΟγΤ°AV within the student's major subject; two courses (minimum three units each) |
|
Q - Quantitative |
6 |
Q courses may be lower or upper division; two courses (total six units or more) | |
B - Breadth |
18 |
Designated Breadth |
Must be outside the student's major subject, and may be lower or upper division: Two courses (total six units or more) Social Sciences: B-Soc |
6 |
Additional Breadth |
Two courses (total six units or more) outside the student's major subject (may or may not be B-designated courses, and will likely help fulfil individual degree program requirements). Students choosing to complete a joint major, joint honours, double major, two extended minors, an extended minor and a minor, or two minors may satisfy the breadth requirements (designated or not designated) with courses completed in either one or both program areas. |
Residency Requirements and Transfer Credit
- At least half of the program's total units must be earned through Ά‘ΟγΤ°AV study.
- At least two thirds of the program's total upper division units must be earned through Ά‘ΟγΤ°AV study.
Elective Courses
In addition to the courses listed above, students should consult an academic advisor to plan the remaining required elective courses.