Please note:
To view the Fall 2018 Academic Calendar go to www.sfu.ca/students/calendar/2018/fall.html
Department of Mathematics Simon Fraser University Calendar  Spring 2019
Mathematics and Computing Science Joint Major
This program is offered cooperatively by the Department of Mathematics and the School of Computing Science. In general, students are expected to meet the requirements of both the department and the school with respect to admission, continuation and graduation requirements.
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.
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.
Computing science course entry requires a grade of C or better in each prerequisite course. A minimum 2.40 CGPA is required for 200, 300 and 400 division computing courses.
Program Requirements
Students complete 120 units as specified below.
Course and prerequisite admission is subject to departmental requirements.
Faculty of Applied Sciences residency requirements apply to the computing science courses used toward the program. The program is subject to Faculty of Science and University regulations.
Lower Division Requirements
Complete all three 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 and be exposed to diverse fields within, and applications of computing science. Topics will include: pseudocode, data types and control structures, fundamental algorithms, computability and complexity, computer architecture, and history of computing science. 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 
Angelica Lim 
Mo, We, Fr 9:30 AM – 10:20 AM 
AQ 3182, Burnaby 
D101 
Angelica Lim 
Mo 10:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D102 
Angelica Lim 
Mo 11:30 AM – 12:20 PM 
ASB 9838, Burnaby 
D103 
Angelica Lim 
Mo 12:30 PM – 1:20 PM 
ASB 9838, Burnaby 
D104 
Angelica Lim 
Mo 1:30 PM – 2:20 PM 
ASB 9838, Burnaby 
D105 
Angelica Lim 
Mo 2:30 PM – 3:20 PM 
ASB 9838, Burnaby 
D106 
Angelica Lim 
Mo 3:30 PM – 4:20 PM 
ASB 9838, Burnaby 
D107 
Angelica Lim 
Mo 4:30 PM – 5:20 PM 
ASB 9838, Burnaby 
D108 
Angelica Lim 
Mo 5:30 PM – 6:20 PM 
ASB 9838, Burnaby 
D200 
Angelica Lim 
Mo, We, Fr 12:30 PM – 1:20 PM 
AQ 3182, Burnaby 
D201 
Angelica Lim 
Tu 1:30 PM – 2:20 PM 
ASB 9838, Burnaby 
D202 
Angelica Lim 
Tu 2:30 PM – 3:20 PM 
ASB 9838, Burnaby 
D203 
Angelica Lim 
Tu 3:30 PM – 4:20 PM 
ASB 9838, Burnaby 
D204 
Angelica Lim 
Tu 4:30 PM – 5:20 PM 
ASB 9838, Burnaby 
D205 
Angelica Lim 
We 8:30 AM – 9:20 AM 
ASB 9838, Burnaby 
D206 
Angelica Lim 
We 9:30 AM – 10:20 AM 
ASB 9838, Burnaby 
D207 
Angelica Lim 
We 10:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D208 
Angelica Lim 
We 11:30 AM – 12:20 PM 
ASB 9838, Burnaby 
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: fundamental algorithms; elements of empirical and theoretical algorithmics; abstract data types and elementary data structures; basic objectoriented programming and software design; computation and computability; specification and program correctness; and history of computing science. Prerequisite: CMPT 120. Corequisite: CMPT 127. Students with credit for CMPT 126, 129, 135 or CMPT 200 or higher may not take for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Mo Chen 
Mo, We, Fr 3:30 PM – 4:20 PM 
RCB IMAGTH, Burnaby 
Builds on CMPT 120 to give a handson introduction to programming in C and C++, the basics of program design, essential algorithms and data structures. Guided labs teach the standard tools and students exploit these ideas to create software that works. To be taken in parallel with CMPT 125. Prerequisite: CMPT 120 or CMPT 128 or CMPT 130. Corequisite: CMPT 125.
Section  Instructor  Day/Time  Location 

D100 
Anne Lavergne 
Tu 8:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D200 
Anne Lavergne 
Tu 11:30 AM – 2:20 PM 
ASB 9838, Burnaby 
D300 
Anne Lavergne 
Tu 2:30 PM – 5:20 PM 
ASB 9838, Burnaby 
D400 
Anne Lavergne 
We 8:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D500 
Anne Lavergne 
We 11:30 AM – 2:20 PM 
ASB 9838, Burnaby 
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). 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. Students with credit for CMPT 125, 126, or 129 may not take this course for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Toby Donaldson 
Mo, We, Fr 2:30 PM – 3:20 PM 
SUR 5280, Surrey 
D101 
Toby Donaldson 
Th 10:30 AM – 11:20 AM 
SUR 4080, Surrey 
D102 
Toby Donaldson 
Th 11:30 AM – 12:20 PM 
SUR 4080, Surrey 
D103 
Toby Donaldson 
Th 12:30 PM – 1:20 PM 
SUR 4080, Surrey 
D104 
Toby Donaldson 
Th 1:30 PM – 2:20 PM 
SUR 4080, Surrey 
D105 
Toby Donaldson 
Fr 12:30 PM – 1:20 PM 
SUR 4080, Surrey 
D106 
Toby Donaldson 
Fr 1:30 PM – 2:20 PM 
SUR 4080, 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; objectoriented programming; time and space efficiency analysis; and experimental evaluation. Prerequisite: (MACM 101 and ((CMPT 125 and 127), CMPT 129 or CMPT 135)) or (ENSC 251 and ENSC 252). Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Anne Lavergne 
Mo, We, Fr 3:30 PM – 4:20 PM 
AQ 3181, Burnaby 
D101 
Anne Lavergne 
Th 9:30 AM – 10:20 AM 
ASB 9838, Burnaby 
D102 
Anne Lavergne 
Th 10:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D103 
Anne Lavergne 
Th 11:30 AM – 12:20 PM 
ASB 9838, Burnaby 
D104 
Anne Lavergne 
Th 12:30 PM – 1:20 PM 
ASB 9838, Burnaby 
D105 
Anne Lavergne 
Th 1:30 PM – 2:20 PM 
ASB 9838, Burnaby 
D106 
Anne Lavergne 
Th 2:30 PM – 3:20 PM 
ASB 9838, Burnaby 
D107 
Anne Lavergne 
Th 3:30 PM – 4:20 PM 
ASB 9838, Burnaby 
D108 
Anne Lavergne 
Th 4:30 PM – 5:20 PM 
ASB 9838, Burnaby 
D200 
Leonid Chindelevitch 
Tu 11:30 AM – 1:20 PM Th 11:30 AM – 12:20 PM 
AQ 3181, Burnaby AQ 3182, Burnaby 
D201 
Leonid Chindelevitch 
Mo 9:30 AM – 10:20 AM 
ASB 9838, Burnaby 
D202 
Leonid Chindelevitch 
Mo 10:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D203 
Leonid Chindelevitch 
Mo 11:30 AM – 12:20 PM 
ASB 9838, Burnaby 
D204 
Leonid Chindelevitch 
Mo 12:30 PM – 1:20 PM 
ASB 9838, Burnaby 
D205 
Leonid Chindelevitch 
Mo 1:30 PM – 2:20 PM 
ASB 9838, Burnaby 
D206 
Leonid Chindelevitch 
Mo 2:30 PM – 3:20 PM 
ASB 9838, Burnaby 
D207 
Leonid Chindelevitch 
Mo 3:30 PM – 4:20 PM 
ASB 9838, Burnaby 
D208 
Leonid Chindelevitch 
Mo 4:30 PM – 5:20 PM 
ASB 9838, Burnaby 
The curriculum introduces students to topics in computer architecture that are considered fundamental to an understanding of the digital systems underpinnings of computer systems. Prerequisite: Either (MACM 101 and ((CMPT 125 and CMPT 127) or CMPT 135)) or (MATH 151 and CMPT 102 for students in an Applied Physics program). Students with credits for CMPT 150 or 250 may not take this course for further credit.
Section  Instructor  Day/Time  Location 

D100 
Brad Bart 
Mo, Fr 10:30 AM – 11:20 AM We 10:30 AM – 11:20 AM 
AQ 3182, Burnaby EDB 7618, Burnaby 
D101 
Brad Bart 
We 11:30 AM – 12:20 PM 
ASB 9838, Burnaby 
D102 
Brad Bart 
We 12:30 PM – 1:20 PM 
ASB 9838, Burnaby 
D103 
Brad Bart 
We 1:30 PM – 2:20 PM 
ASB 9838, Burnaby 
D104 
Brad Bart 
We 2:30 PM – 3:20 PM 
ASB 9838, Burnaby 
D105 
Brad Bart 
We 3:30 PM – 4:20 PM 
ASB 9838, Burnaby 
D106 
Brad Bart 
We 4:30 PM – 5:20 PM 
ASB 9838, Burnaby 
D107 
Brad Bart 
We 5:30 PM – 6:20 PM 
ASB 9838, Burnaby 
D200 
Brad Bart 
Mo, We, Fr 12:30 PM – 1:20 PM 
AQ 3181, Burnaby 
D201 
Brad Bart 
Th 9:30 AM – 10:20 AM 
ASB 9838, Burnaby 
D202 
Brad Bart 
Th 10:30 AM – 11:20 AM 
ASB 9838, Burnaby 
D203 
Brad Bart 
Th 11:30 AM – 12:20 PM 
ASB 9838, Burnaby 
D204 
Brad Bart 
Th 12:30 PM – 1:20 PM 
ASB 9838, Burnaby 
D205 
Brad Bart 
Th 1:30 PM – 2:20 PM 
ASB 9838, Burnaby 
D206 
Brad Bart 
Th 2:30 PM – 3:20 PM 
ASB 9838, Burnaby 
D207 
Brad Bart 
Th 3:30 PM – 4:20 PM 
ASB 9838, Burnaby 
D208 
Brad Bart 
Th 4:30 PM – 5:20 PM 
ASB 9838, Burnaby 
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 
Ramesh Krishnamurti 
Mo 2:30 PM – 3:20 PM We, Fr 2:30 PM – 3:20 PM 
SWH 10081, Burnaby AQ 3182, Burnaby 
D101 
Ramesh Krishnamurti 
Th 9:30 AM – 10:20 AM 
AQ 5020, Burnaby 
D102 
Ramesh Krishnamurti 
Th 9:30 AM – 10:20 AM 
AQ 5004, Burnaby 
D103 
Ramesh Krishnamurti 
Th 10:30 AM – 11:20 AM 
AQ 5004, Burnaby 
D104 
Ramesh Krishnamurti 
Th 11:30 AM – 12:20 PM 
AQ 5005, Burnaby 
D105 
Ramesh Krishnamurti 
Th 12:30 PM – 1:20 PM 
BLU 10031, Burnaby 
D106 
Ramesh Krishnamurti 
Th 12:30 PM – 1:20 PM 
WMC 2200, Burnaby 
D107 
Ramesh Krishnamurti 
We 3:30 PM – 4:20 PM 
BLU 10901, Burnaby 
D108 
Ramesh Krishnamurti 
We 4:30 PM – 5:20 PM 
BLU 10901, Burnaby 
D200 
Steve Pearce 
Mo, We, Fr 11:30 AM – 12:20 PM 
SUR 5240, Surrey 
D201 
Steve Pearce 
We 12:30 PM – 1:20 PM 
SUR 5060, Surrey 
D202 
Steve Pearce 
We 1:30 PM – 2:20 PM 
SUR 5060, Surrey 
D203 
Steve Pearce 
We 2:30 PM – 3:20 PM 
SUR 5060, Surrey 
D204 
Steve Pearce 
We 3:30 PM – 4:20 PM 
SUR 5060, Surrey 
A continuation of MACM 101. Topics covered include graph theory, trees, inclusionexclusion, 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 

D100 

Mo, We 12:30 PM – 1:20 PM Fr 12:30 PM – 1:20 PM 
RCB IMAGTH, Burnaby RCB IMAGTH, Burnaby 
D200 
Ladislav Stacho 
Mo, We, Fr 8:30 AM – 9:20 AM 
SUR 3310, Surrey 
OP01 

TBD  
OP02 

TBD 
Mathematical induction. Limits of real sequences and real functions. Continuity and its consequences. The mean value theorem. The fundamental theorem of calculus. Series. Prerequisite: MATH 152; or MATH 155 or 158 with a grade of B. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Nathan Ilten 
Mo, We, Fr 1:30 PM – 2:20 PM 
AQ 3005, Burnaby 
D101 

Th 2:30 PM – 3:20 PM 
AQ 5005, Burnaby 
D102 

Th 3:30 PM – 4:20 PM 
AQ 5005, 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; 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 

E100 
Luis Goddyn 
Mo, We 4:30 PM – 5:50 PM 
AQ 3181, Burnaby 
OP01 

TBD 
Basic laws of probability, sample distributions. Introduction to statistical inference and applications. Prerequisite: or Corequisite: MATH 152 or 155 or 158. 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 

C100  Distance Education  
D100 
Tim Swartz 
Mo, Fr 9:30 AM – 10:20 AM We 9:30 AM – 10:20 AM 
SSCB 9200, Burnaby SSCC 9002, Burnaby 
D900 
Sessional 
Tu 8:30 AM – 10:20 AM Th 8:30 AM – 9:20 AM 
SUR 3240, Surrey SUR 3240, Surrey 
OP01 

TBD  
OP09 

TBD 
and either
An overview of various techniques used for software development and software project management. Major tasks and phases in modern software development, including requirements, analysis, documentation, design, implementation, testing,and maintenance. Project management issues are also introduced. Students complete a team project using an iterative development process. Prerequisite: One W course, CMPT 225, (MACM 101 or (ENSC 251 and ENSC 252)) and (MATH 151 or MATH 150). MATH 154 or MATH 157 with at least a B+ may be substituted for MATH 151 or MATH 150. Students with credit for CMPT 275 may not take this course for further credit.
Section  Instructor  Day/Time  Location 

D100 
Toby Donaldson 
Mo, We, Fr 11:30 AM – 12:20 PM 
SUR 3170, Surrey 
E100 
Rob Cameron 
Tu 5:30 PM – 8:20 PM 
SWH 10041, Burnaby 
or both of
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.
Section  Instructor  Day/Time  Location 

D100 
Petr Lisonek 
Tu 2:30 PM – 3:20 PM 
ASB 9840, Burnaby 
D101 

We 2:30 PM – 3:20 PM 
AQ 3148.1, Burnaby 
D102 

We 3:30 PM – 4:20 PM 
AQ 3148.1, Burnaby 
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.
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 

C100  Distance Education  
D100 
Sophie Burrill 
Mo, Tu, We, Fr 8:30 AM – 9:20 AM 
SSCB 9201, Burnaby 
D200 

Mo, We, Fr 11:30 AM – 12:20 PM We 1:30 PM – 2:20 PM 
SP 291, Surrey SUR 2740, 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: 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 biological and medical sciences. Topics include: limits, growth rate and the derivative; elementary functions, optimization and approximation methods, and their applications; mathematical models of biological processes. 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.
Section  Instructor  Day/Time  Location 

D100 
Luis Goddyn 
Mo, We, Fr 8:30 AM – 9:20 AM 
AQ 3182, 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: 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 

Mo, We, Fr 11:30 AM – 12:20 PM 
SSCB 9201, Burnaby 
D200 

Mo, We, Fr 12:30 PM – 1:20 PM 
SUR 3090, 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. 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; 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 
Nilima Nigam Veselin Jungic 
Mo, We, Fr 8:30 AM – 9:20 AM 
SSCC 9001, Burnaby 
D200 

Mo, We, Fr 11:30 AM – 12:20 PM 
SUR 5280, Surrey 
D300 
Jamie Mulholland 
Mo, We, Fr 8:30 AM – 9:20 AM 
WMC 2810, Burnaby 
OP01 

TBD  
OP02 

TBD  
OP03 

TBD 
Designed for students specializing in the biological and medical sciences. Topics include: the integral, partial derivatives, differential equations, linear systems, and their applications; mathematical models of biological processes. Prerequisite: MATH 150, 151 or 154; 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 

Mo, We, Fr 8:30 AM – 9:20 AM 
RCB IMAGTH, Burnaby 
D200 

Mo, We, Fr 9:30 AM – 10:20 AM 
SUR 2600, 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 firstorder equations and their applications; sequences and series. Prerequisite: MATH 150 or 151 or 154 or 157. Students with credit for MATH 152 or 155 may not take MATH 158 for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

E100 
Petra Menz 
Mo 4:30 PM – 5:20 PM We 4:30 PM – 6:20 PM 
SSCB 9200, Burnaby SSCB 9200, Burnaby 
OP01 

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; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 240 make not take this course for further credit. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Manfred Trummer 
Mo, We, Fr 11:30 AM – 12:20 PM 
RCB IMAGTH, Burnaby 
D200 

Mo, We, Fr 2:30 PM – 3:20 PM 
SUR 3090, 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; 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 
Stephen Choi 
Mo, We, Fr 11:30 AM – 12:20 PM 
SSCC 9000, Burnaby 
OP01 

TBD 
* strongly recommended
** with a B grade or better
+ The following substitutions are also permitted. They may not also be used to satisfy the upper division requirements below. MACM 409  Numerical Linear Algebra: Algorithms, Implementation and Application (3) for MACM 203. MACM 401  Introduction to Computer Algebra (3) for MACM 204. MACM 442  Cryptography (3) for MACM 204.
Upper Division Requirements
Students complete at least 45 units, including all of
Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.
Section  Instructor  Day/Time  Location 

D100 
Valentine Kabanets 
Mo, We, Fr 11:30 AM – 12:20 PM 
AQ 3150, Burnaby 
D200 
Kay C Wiese 
Tu 2:30 PM – 4:20 PM Th 2:30 PM – 3:20 PM 
WMC 3260, Burnaby SSCK 9500, Burnaby 
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 
David Muraki 
Mo, We, Fr 12:30 PM – 1:20 PM 
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 
The integers and mathematical proof. Relations and modular arithmetic. Rings and fields, polynomial rings, the Euclidean algorithm. The complex numbers and the fundamental theorem of algebra. Construction of finite fields, primitive elements in finite fields, and their application. Prerequisite: MATH 240 (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.
and one of
This course aims to give the student an understanding of what a modern operating system is, and the services it provides. It also discusses some basic issues in operating systems and provides solutions. Topics include multiprogramming, process management, memory management, and file systems. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)).
Section  Instructor  Day/Time  Location 

D100 
Janice Regan 
Mo, We, Fr 1:30 PM – 2:20 PM 
EDB 7618, Burnaby 
D200 
Tianzheng Wang 
Mo, Fr 10:30 AM – 11:20 AM We 10:30 AM – 11:20 AM 
AQ 3149, Burnaby AQ 3154, Burnaby 
Data communication fundamentals (data types, rates, and transmission media). Network architectures for local and wide areas. Communications protocols suitable for various architectures. ISO protocols and internetworking. Performance analysis under various loadings and channel error rates. Prerequisite: CMPT 225, (CMPT 150, ENSC 150 or CMPT 295) and MATH 151 (MATH 150). MATH 154 or 157 with a grade of at least B+ may be substituted for MATH 151 (MATH 150).
Section  Instructor  Day/Time  Location 

D100 
Qianping Gu 
Mo, We, Fr 12:30 PM – 1:20 PM 
AQ 3003, Burnaby 
D200 
Jiangchuan Liu 
Tu 1:30 PM – 2:20 PM Th 12:30 PM – 2:20 PM 
AQ 3005, Burnaby WMC 3260, Burnaby 
This course covers the key components of a compiler for a high level programming language. Topics include lexical analysis, parsing, type checking, code generation and optimization. Students will work in teams to design and implement an actual compiler making use of tools such as lex and yacc. Prerequisite: MACM 201, (CMPT 150, CMPT 295 or ENSC 215) and CMPT 225.
and one of
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. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Petr Lisonek 
Mo, We, Fr 2:30 PM – 3:20 PM 
AQ 3149, Burnaby 
D101 

Tu 2:30 PM – 3:20 PM 
WMC 2830, Burnaby 
D102 

Tu 3:30 PM – 4:20 PM 
WMC 2830, Burnaby 
D103 

Tu 4:30 PM – 5:20 PM 
WMC 2830, Burnaby 
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; or MATH 155/158 with a grade of at least B, MATH 232 or 240. Quantitative.
Section  Instructor  Day/Time  Location 

D100 
Razvan Fetecau 
Mo 1:30 PM – 2:20 PM We, Fr 1:30 PM – 2:20 PM 
SSCB 9200, Burnaby AQ 3181, Burnaby 
D101 

Tu 9:30 AM – 10:20 AM 
WMC 3220, Burnaby 
D102 

Tu 10:30 AM – 11:20 AM 
AQ 5018, Burnaby 
D103 

Tu 4:30 PM – 5:20 PM 
WMC 2503, Burnaby 
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.
and additional work is required to total 21 upper division MATH and 24 upper division CMPT units. MACM are counted in an alternating fashion toward the MATH and CMPT requirements, starting with the first MACM course completed, counting toward either MATH or CMPT. Twelve units must be at the 400 division or higher, including at least three units each of CMPT and MATH.
Other Requirements
The program is subject to Faculty of Science and University regulations. Course and prerequisite admission is subject to departmental requirements. MACM major graduation is contingent upon a cumulative grade point average (CGPA) and upper division grade point average (UDGPA) of 2.00 or better. Students must also achieve a 2.00 or better CGPA and UDGPA in each of the CMPT, MACM and MATH designations. Faculty of Applied Sciences residency requirements apply to the computing science courses used toward the program.
Cooperative Education and Work Experience
All computing science students are strongly encouraged to explore the opportunities that Work Integrated Learning (WIL) can offer. Please contact a computing science or mathematics coop advisor during the first year of studies to ensure that you have all of the necessary courses and information to help plan for a successful coop experience.
Visit http://www.sfu.ca/computing/prospectivestudents/undergraduatestudents/cooperativeeducation.html for more computing science information, or for mathematics, http://www.sfu.ca/coop/contact#science.
University 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.
Please see Faculty of Applied Sciences Residency Requirements for further information.
Elective Courses
In addition to the courses listed above, students should consult a Mathematics or Computing Science advisor to plan the remaining required elective courses.