Please note:
To view the current Academic Calendar, go to www.sfu.ca/students/calendar.html
Mathematics Honours
This program leads to a bachelor of science (BSc) honours degree.
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
Students complete 120 units, as specified below.
Lower Division Requirements
Students complete either
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 highlevel 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 problemsolving 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/BreadthScience.
Section  Instructor  Day/Time  Location 

D100 
Hazra Imran 
Mo
8:30 AM – 10:20 AM
We 8:30 AM – 9:20 AM 
SSCB 9201, Burnaby AQ 3181, Burnaby 
A second course in computing science and programming intended for students studying mathematics, statistics or actuarial science and suitable for students who already have some background in computing science and programming. Topics include: a review of the basic elements of programming: use and implementation of elementary data structures and algorithms; fundamental algorithms and problem solving; basic objectoriented programming and software design; computation and computability and specification and program correctness. Prerequisite: CMPT 102 or CMPT 120, with a minimum grade of C. Students with credit for CMPT 125 or 135 may not take this course for further credit. Quantitative.
(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/BreadthScience.
A second course in systemsoriented programming and computing science that builds upon the foundation set in CMPT 130 using a systemsoriented language such as C or C++. Topics: a review of the basic elements of programming; introduction to objectoriented 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.
and all of
Introduction to counting, induction, automata theory, formal reasoning, modular arithmetic. Prerequisite: BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157. Quantitative/BreadthScience.
Section  Instructor  Day/Time  Location 

D100 
Brad Bart 
Mo, We, Fr
11:30 AM – 12:20 PM

SSCB 9200, Burnaby 
D101 
Tu
2:30 PM – 3:20 PM

AQ 5005, Burnaby 

D102 
Tu
2:30 PM – 3:20 PM

AQ 5006, Burnaby 

D103 
Tu
3:30 PM – 4:20 PM

AQ 5005, Burnaby 

D104 
Tu
3:30 PM – 4:20 PM

AQ 5006, Burnaby 

D105 
Tu
4:30 PM – 5:20 PM

AQ 5006, Burnaby 

D106 
Tu
4:30 PM – 5:20 PM

AQ 5005, Burnaby 

D107 
Tu
5:30 PM – 6:20 PM

AQ 5005, Burnaby 

D108 
Tu
5:30 PM – 6:20 PM

AQ 5006, Burnaby 
Using a mathematical software package for doing calculations in linear algebra. Development of computer models that analyze and illustrate applications of linear algebra. All calculations and experiments will be done in the Matlab software package. Topics include: largescale matrix calculations, experiments with cellular automata, indexing, searching and ranking pages on the internet, population models, data fitting and optimization, image analysis, and cryptography. Prerequisite: One of CMPT 102, 120, 126, 128 or 130 and one of MATH 150, 151, 154 or 157 and one of MATH 232 or 240. MATH 232 or 240 can be taken as corequisite. Students in excess of 80 units may not take MACM 203 for further credit. Quantitative.
Using a mathematical software package for doing computations from calculus. Development of computer models that analyze and illustrate applications of calculus. All calculations and experiments will be done in the Maple software package. Topics include: graphing functions and data, preparing visual aids for illustrating mathematical concepts, integration, Taylor series, numerical approximation methods, 3D visualization of curves and surfaces, multidimensional optimization, differential equations and disease spread models. Prerequisite: One of CMPT 102, 120, 126, 128 or 130 and MATH 251. MATH 251 can be taken as a corequisite. Students in excess of 80 units may not take MACM 204 for further credit. Quantitative.
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 155 or MATH 158 with a grade of at least B. Recommended: It is recommended that MATH 240 or 232 be taken before or concurrently with MATH 251. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Hansol Park 
Mo, We, Fr
1:30 PM – 2:20 PM

SSCB 9201, Burnaby 
D400 
Justin Chan 
Mo, We, Fr
9:30 AM – 10:20 AM

SRYC 5280, Surrey 
OP01  TBD  
OP02  TBD 
Vector calculus, divergence, gradient and curl; line, surface and volume integrals; conservative fields, theorems of Gauss, Green and Stokes; general curvilinear coordinates and tensor notation. Introduction to orthogonality of functions, orthogonal polynomials and Fourier series. Prerequisite: MATH 240 or 232, and 251, all with a minimum grade of C. MATH 240 or 232 may be taken concurrently. Students with credit for MATH 254 may not take MATH 252 for further credit. Quantitative.
Firstorder differential equations, second and higherorder linear equations, series solutions, introduction to Laplace transform, systems and numerical methods, applications in the physical, biological and social sciences. Prerequisite: MATH 152 with a minimum grade of C; or MATH 155 or 158, with a grade of at least B; MATH 232 or 240, with a minimum grade of C. Students with credit for MATH 310 may not take this course for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Stephen Choi 
Mo, We, Fr
12:30 PM – 1:20 PM

EDB 7618, Burnaby 
D101 
Mo
4:30 PM – 5:20 PM

AQ 5005, Burnaby 

D102 
Tu
10:30 AM – 11:20 AM

WMC 2830, Burnaby 

D103 
Tu
11:30 AM – 12:20 PM

WMC 2830, Burnaby 

D104 
Tu
9:30 AM – 10:20 AM

WMC 2830, Burnaby 

D105 
Mo
5:30 PM – 6:20 PM

AQ 5005, Burnaby 

D400 
Justin Chan 
Mo, We, Fr
12:30 PM – 1:20 PM

SRYC 5280, Surrey 
D401 
We
2:30 PM – 3:20 PM

SRYC 2740, Surrey 

D402 
We
3:30 PM – 4:20 PM

SRYC 2740, Surrey 
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 

D100 
Wei Lin 
We
11:30 AM – 12:20 PM
Fr 10:30 AM – 12:20 PM 
SSCB 9201, Burnaby AQ 3182, Burnaby 
OL01 
Gamage Perera 
TBD  
OP01  TBD 
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: PreCalculus 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 Simon Fraser University 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 

D100 
MacKenzie Carr 
Mo, We, Fr
1:30 PM – 2:20 PM

BLU 9660, Burnaby 
D101 
Tu
8:30 AM – 9:20 AM

SWH 10061, Burnaby 

D102 
Tu
9:30 AM – 10:20 AM

SWH 10061, Burnaby 

D103 
Tu
10:30 AM – 11:20 AM

SWH 10061, Burnaby 

OP01  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: PreCalculus 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 Simon Fraser University 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: PreCalculus 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 Simon Fraser University Calculus Readiness Test. Students with credit for either MATH 150, 151 or 157 may not take MATH 154 for further credit. Quantitative.
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: PreCalculus 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 Simon Fraser University 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 

D100 
Mahsa Faizrahnemoon 
Mo, We, Fr
11:30 AM – 12:20 PM

AQ 3154, Burnaby 
OP01  TBD 
and one of
Riemann sum, Fundamental Theorem of Calculus, definite, indefinite and improper integrals, approximate integration, integration techniques, applications of integration. Firstorder separable differential equations and growth models. Sequences and series, series tests, power series, convergence and applications of power series. Prerequisite: MATH 150 or 151, with a minimum grade of C; or MATH 154 or 157 with a grade of at least B. Students with credit for MATH 155 or 158 may not take this course for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Alexander Rutherford 
Mo, We, Fr
8:30 AM – 9:20 AM

SSCB 9200, Burnaby 
OP01  TBD 
Designed for students specializing in the life sciences. Topics include: vectors and matrices, partial derivatives, multidimensional integrals, systems of differential equations, compartment models, graphs and networks, and their applications to the life sciences; mathematical models of multicomponent biological processes and their implementation and analysis using software. 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 

D100 
Vijaykumar Singh 
Mo, We, Fr
8:30 AM – 9:20 AM

AQ 3182, Burnaby 
OPO1  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 firstorder 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.
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 

D400 
Navpreet Kaur 
Mo, We, Fr
1:30 PM – 2:20 PM

SRYE 1002, Surrey 
OP01  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 

D100 
Jonathan Jedwab 
Mo, We, Fr
11:30 AM – 12:20 PM

AQ 3149, Burnaby 
D101 
Th
9:30 AM – 10:20 AM

AQ 5005, Burnaby 

D102 
Th
2:30 PM – 3:20 PM

AQ 5005, Burnaby 

D103 
Th
3:30 PM – 4:20 PM

AQ 5005, Burnaby 
and at least one 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; objectoriented 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 

D100 
Toby Donaldson 
Tu
12:30 PM – 2:20 PM
Fr 12:30 PM – 1:20 PM 
SSCB 9201, Burnaby WMC 3520, Burnaby 
D101 
We
11:30 AM – 12:20 PM

ASB 9838, Burnaby 

D102 
We
11:30 AM – 12:20 PM

ASB 9838, Burnaby 

D103 
Th
9:30 AM – 10:20 AM

ASB 9838, Burnaby 

D104 
Th
9:30 AM – 10:20 AM

ASB 9838, Burnaby 

D105 
Th
10:30 AM – 11:20 AM

ASB 9838, Burnaby 

D106 
Th
10:30 AM – 11:20 AM

ASB 9838, Burnaby 

D107 
We
12:30 PM – 1:20 PM

ASB 9838, Burnaby 

D108 
We
12:30 PM – 1:20 PM

ASB 9838, Burnaby 

D200 
John Edgar 
Mo, We, Fr
8:30 AM – 9:20 AM

SRYE 1002, Surrey 
D201 
Mo
10:30 AM – 11:20 AM

SRYE 4013, Surrey 

D202 
Mo
10:30 AM – 11:20 AM

SRYE 4013, Surrey 

D203 
Mo
11:30 AM – 12:20 PM

SRYE 4013, Surrey 

D204 
Mo
11:30 AM – 12:20 PM

SRYE 4013, Surrey 

D205 
Mo
12:30 PM – 1:20 PM

SRYE 4013, Surrey 

D206 
Mo
12:30 PM – 1:20 PM

SRYE 4013, Surrey 

D207 
Mo
1:30 PM – 2:20 PM

SRYE 4013, Surrey 

D208 
Mo
1:30 PM – 2:20 PM

SRYE 4013, Surrey 
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.
and an additional six units from the Faculty of Science outside of the departments of Mathematics and Statistics and Actuarial Science and excluding PHYS 100, BISC 100 and CHEM 110/111.
+The following substitutions are also permitted.
They may not be used to satisfy the upper division requirements below.
MACM 409  Numerical Linear Algebra: Algorithms, Implementation and Applications (3) for MACM 203.
MACM 401  Introduction to Computer Algebra (3) for MACM 204.
MACM 442  Cryptography (3) for MACM 204.
* strongly recommended
** with a B grade or better
Upper Division Requirements
Students complete at least 48 units of which at least 15 must be at the 400 level. Students complete all of
The integers, fundamental theorem of arithmetic. Equivalence relations, modular arithmetic. Univariate polynomials, unique factorization. Rings and fields. Units, zero divisors, integral domains. Ideals, ring homomorphisms. Quotient rings, the ring isomorphism theorem. Chinese remainder theorem. Euclidean, principal ideal, and unique factorization domains. Field extensions, minimal polynomials. Classification of finite fields. Prerequisite: MATH 240 with a minimum grade of C or MATH 232 with a grade of at least B. Students with credit for MATH 332 may not take this course for further credit. Quantitative.
Finite groups and subgroups. Cyclic groups and permutation groups. Cosets, normal subgroups and factor groups. Homomorphisms and isomorphisms. Fundamental theorem of finite abelian groups. Sylow theorems. Prerequisite: MATH 340 or 342 or 332, with a minimum grade of C. Students with credit for MATH 339 may not take this course for further credit.
Students will develop skills required for mathematical research. This course will focus on communication in both written and oral form. Students will write documents and prepare presentations in a variety of formats for academic and nonacademic purposes. The LaTeX document preparation system will be used. Course will be given on a pass/fail basis. Corequisite: MATH 499W. Students must have an approved project prior to enrollment.
An honours research project in mathematics is an original presentation of an area or problem in mathematics. A typical project is an original synthesis of knowledge generated from students research experience. A project can contain substantive, original mathematics, but need not. The presentation consists of a written report and an oral presentation both of which must be completed before the end of the exam period. Prerequisite: 18 units of upper division MATH or MACM courses. Must be in an honours program with a GPA of at least 3.0. Corequisite: MATH 498. Students must have an approved project prior to enrollment. Writing.
and one of
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 grade of at least B). 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 grade of at least B). Quantitative.
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.
An introduction to the theory and practice of errorcorrecting codes. Topics will include finite fields, polynomial rings, linear and nonlinear codes, BCH codes, convolutional codes, majority logic decoding, weight distribution of codes, and bounds on the size of codes. Prerequisite: MATH 340 or 332, with a minimum grade of C. Quantitative.
In addition to the above core requirement of 21 units, students must complete the requirements for at least one of the three concentrations below and three additional units of upper division MATH or MACM courses.
Algebra and Number Theory Concentration
Students complete at least nine units from the following list of which at least three units must be at the 400 level.
Data structures and algorithms for mathematical objects. Topics include long integer arithmetic, computing polynomial greatest common divisors, the fast Fourier transform, Hensel's lemma and padic methods, differentiation and simplification of formulae, and polynomial factorization. Students will use a computer algebra system such as Maple for calculations and programming. Prerequisite: CMPT 307 or ((MATH 340 or MATH 342) and (CMPT 225 or MACM 204)). Quantitative.
An introduction to the subject of modern cryptography. Classical methods for cryptography and how to break them, the data encryption standard (DES), the advanced encryption standard (AES), the RSA and ElGammal public key cryptosystems, digital signatures, secure hash functions and pseudorandom number generation. Algorithms for computing with long integers including the use of probabilistic algorithms. Prerequisite: (CMPT 201 or 225) and one of (MATH 340 or 332 or 342); or CMPT 405. Students with credit for MACM 498 between Fall 2003 and Spring 2006 may not take this course for further credit. Quantitative.
Linear Algebra. Vector space and matrix theory. Prerequisite: MATH 340 or 332, with a minimum grade of C or permission of the instructor. Students with credit for MATH 438 may not take this course for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Imin Chen Jaskaran Kaur 
We
3:30 PM – 4:20 PM
Fr 2:30 PM – 4:20 PM 
WMC 2507, Burnaby WMC 2507, Burnaby 
D102 
We
12:30 PM – 1:20 PM

WMC 2810, Burnaby 
The prime numbers, unique factorization, congruences and quadratic reciprocity. Topics include the RSA public key cryptosystem and the prime number theorem. Prerequisite: MATH 240 or 232, with a minimum grade of C, and one additional 200level MATH or MACM course. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Imin Chen Jonathan Jedwab 
Mo
2:30 PM – 4:20 PM
We 2:30 PM – 3:20 PM 
AQ 3181, Burnaby AQ 3181, Burnaby 
D101 
We
10:30 AM – 11:20 AM

WMC 2810, Burnaby 

D102 
We
11:30 AM – 12:20 PM

WMC 2810, Burnaby 

D103 
We
9:30 AM – 10:20 AM

WMC 2810, Burnaby 
An introduction to the theory of fields, with emphasis on Galois theory. Prerequisite: MATH 340 or 332, with a minimum grade of C. Quantitative.
A study of ideals and varieties. Topics include affine varieties, ideals, Groebner bases, the Hilbert basis theorem, resultants and elimination, Hilbert's Nullstellensatz, irreducible varieties and prime ideals, decomposition of varieties, polynomial mappings, quotient rings, projective space and projective varieties. Prerequisite: MATH 340 with a minimum grade of C. Students who have taken this course as MATH 439 Special Topics may not complete this course for further credit.
An introduction to the theory and practice of errorcorrecting codes. Topics will include finite fields, polynomial rings, linear and nonlinear codes, BCH codes, convolutional codes, majority logic decoding, weight distribution of codes, and bounds on the size of codes. Prerequisite: MATH 340 or 332, with a minimum grade of C. Quantitative.
Analysis and Optimization Concentration
Students complete at least nine units from the following list of which at least three units must be at the 400 level.
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 

D100 
Jane MacDonald 
Mo, We, Fr
10:30 AM – 11:20 AM

SSCB 9200, Burnaby 
D101 
We
2:30 PM – 3:20 PM

WMC 2830, Burnaby 

D102 
We
3:30 PM – 4:20 PM

WMC 2830, Burnaby 

D103 
We
4:30 PM – 5:20 PM

WMC 2830, Burnaby 

D104 
Th
9:30 AM – 10:20 AM

WMC 2830, Burnaby 

D105 
Th
10:30 AM – 11:20 AM

WMC 2830, Burnaby 

D106 
Th
11:30 AM – 12:20 PM

WMC 2830, Burnaby 

D107 
We
4:30 PM – 5:20 PM

AQ 5016, Burnaby 
Linear programming modelling. The simplex method and its variants. Duality theory. Postoptimality 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.
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.
Fourier series, ODE boundary and eigenvalue problems. Separation of variables for the diffusion wave and Laplace/Poisson equations. Polar and spherical coordinate systems. Symbolic and numerical computing, and graphics for PDEs. Prerequisite: MATH 260 or MATH 310, with a minimum grade of C; and one of MATH 251 with a grade of B+, or one of MATH 252 or 254, with a minimum grade of C. Quantitative.
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.
Firstorder linear equations, the method of characteristics. The wave equation. Harmonic functions, the maximum principle, Green's functions. The heat equation. Distributions and transforms. Higher dimensional eigenvalue problems. An introduction to nonlinear equations. Burgers' equation and shock waves. Prerequisite: (MATH 260 or MATH 310) and one of MATH 314, MATH 320, MATH 322, PHYS 384, all with a minimum grade of C. An alternative to the above prerequisite is both of (MATH 252 or MATH 254) and (MATH 260 or MATH 310), both with grades of at least A. Quantitative.
Convergence in Euclidean spaces, Fourier series and their convergence, Legendre polynomials, Hermite and Laguerre polynomials. Prerequisite: MATH 232 or 240 and one of MATH 314, 320, 322, PHYS 384, all with a minimum grade of C. Students with credit for MATH 420 or MATH 719 may not complete this course for further credit. Quantitative.
Metric spaces, normed vector spaces, measure and integration, an introduction to functional analysis. Prerequisite: MATH 320 with a minimum grade of C. Quantitative.
An introduction to probability from the rigorous point of view. Random variables. Generating functions. Convergence of random variables. The strong law of large numbers and the central limit theorem. Stochastic processes. Stationary process and martingales. Prerequisite: MATH 242 and (MATH 348 or STAT 380), all with a minimum grade of C.
Section  Instructor  Day/Time  Location 

D100 
Paul Tupper 
Mo
12:30 PM – 2:20 PM
We 1:30 PM – 2:20 PM 
WMC 2830, Burnaby WMC 2830, Burnaby 
Discrete Mathematics Concentration
Students complete
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; objectoriented 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 

D100 
Toby Donaldson 
Tu
12:30 PM – 2:20 PM
Fr 12:30 PM – 1:20 PM 
SSCB 9201, Burnaby WMC 3520, Burnaby 
D101 
We
11:30 AM – 12:20 PM

ASB 9838, Burnaby 

D102 
We
11:30 AM – 12:20 PM

ASB 9838, Burnaby 

D103 
Th
9:30 AM – 10:20 AM

ASB 9838, Burnaby 

D104 
Th
9:30 AM – 10:20 AM

ASB 9838, Burnaby 

D105 
Th
10:30 AM – 11:20 AM

ASB 9838, Burnaby 

D106 
Th
10:30 AM – 11:20 AM

ASB 9838, Burnaby 

D107 
We
12:30 PM – 1:20 PM

ASB 9838, Burnaby 

D108 
We
12:30 PM – 1:20 PM

ASB 9838, Burnaby 

D200 
John Edgar 
Mo, We, Fr
8:30 AM – 9:20 AM

SRYE 1002, Surrey 
D201 
Mo
10:30 AM – 11:20 AM

SRYE 4013, Surrey 

D202 
Mo
10:30 AM – 11:20 AM

SRYE 4013, Surrey 

D203 
Mo
11:30 AM – 12:20 PM

SRYE 4013, Surrey 

D204 
Mo
11:30 AM – 12:20 PM

SRYE 4013, Surrey 

D205 
Mo
12:30 PM – 1:20 PM

SRYE 4013, Surrey 

D206 
Mo
12:30 PM – 1:20 PM

SRYE 4013, Surrey 

D207 
Mo
1:30 PM – 2:20 PM

SRYE 4013, Surrey 

D208 
Mo
1:30 PM – 2:20 PM

SRYE 4013, Surrey 
and at least nine units from the following list of which at least three units must be at the 400 level.
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 NPcompleteness. 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 

D100 
Valentine Kabanets 
We
3:30 PM – 4:20 PM
Fr 2:30 PM – 4:20 PM 
SSCK 9500, Burnaby SSCK 9500, Burnaby 
Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NPcompleteness, approximation algorithms, selected topics. Prerequisite: CMPT 307 with a minimum grade of C.
An introduction to the subject of modern cryptography. Classical methods for cryptography and how to break them, the data encryption standard (DES), the advanced encryption standard (AES), the RSA and ElGammal public key cryptosystems, digital signatures, secure hash functions and pseudorandom number generation. Algorithms for computing with long integers including the use of probabilistic algorithms. Prerequisite: (CMPT 201 or 225) and one of (MATH 340 or 332 or 342); or CMPT 405. Students with credit for MACM 498 between Fall 2003 and Spring 2006 may not take this course for further credit. Quantitative.
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 grade of at least B). 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 grade of at least B). Quantitative.
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.
Graph coloring, Hamiltonian graphs, planar graphs, random graphs, Ramsey theory, extremal problems, additional topics. Prerequisite: MATH 345 with a minimum grade of C. Quantitative.
An introduction to the theory and practice of errorcorrecting codes. Topics will include finite fields, polynomial rings, linear and nonlinear codes, BCH codes, convolutional codes, majority logic decoding, weight distribution of codes, and bounds on the size of codes. Prerequisite: MATH 340 or 332, with a minimum grade of C. Quantitative.
Additional Electives
Students must complete an additional 15 upper division units. These units can be any upper division MATH or MACM courses or taken from the following list.
Central forces, rigid body motion, small oscillations. Lagrangian and Hamiltonian formulations of mechanics. Prerequisite: PHYS 384 or permission of the department. Nonphysics majors may enter with MATH 252; MATH 260 or MATH 310; PHYS 211. All prerequisite courses require a minimum grade of C. Quantitative.
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.
They may include additional courses from the three Concentrations. The total number of 400 level units must be at least 15.
NOTE: SFU 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: https://www.sfu.ca/gradstudies/apply/programs/acceleratedmasters.html.
Other Requirements
Of the total 120 units required for the honours, at least 60 units must be from the upper division. A cumulative grade point average (CGPA) of at least 3.00 and an upper division grade point average of at least 3.00 are required. These averages are calculated on all courses completed at the University. If both averages are at least 3.50, the designation 'first class' applies.
University Honours Degree Requirements
Students must also satisfy University degree requirements for degree completion.
Writing, Quantitative, and Breadth Requirements
Students admitted to Simon Fraser University 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 universitywide 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 Simon Fraser University within the student’s major subject  
Q  Quantitative 
6 
Q courses may be lower or upper division  
B  Breadth 
18 
Designated Breadth  Must be outside the student’s major subject, and may be lower or upper division 6 units Social Sciences: BSoc 6 units Humanities: BHum 6 units Sciences: BSci 
6 
Additional Breadth  6 units outside the student’s major subject (may or may not be Bdesignated 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 Simon Fraser University study.
 At least two thirds of the program's total upper division units must be earned through Simon Fraser University study.