Please note:
To view the current Academic Calendar, go to www.sfu.ca/students/calendar.html.
Computing Science Honours
The school offers an honours program leading to a bachelor of science (BSc) or a bachelor of arts (BA) degree. This undergraduate degree is appropriate for many interdisciplinary areas. Visit for further information.
Admission Requirements
Entry into computing science programs is possible via
- direct admission from high school
- direct transfer from a recognized post-secondary institution, or combined transfer units from more than one post-secondary institution
- internal transfer from within 911³Ô¹Ï
Admission is competitive. A separate admission average for each entry route is established each term, depending on spaces available and subject to the approval of the Dean of Applied Sciences. Admission averages are calculated over a set of courses satisfying particular breadth constraints.
Internal Transfer
Internal transfer allows students to transfer, within 911³Ô¹Ï, from one faculty to another.
911³Ô¹Ï students applying for School of Computing Science admission are selected on the basis of an admission Computing Related Grade Point Average (CRGPA) and Cumulative Grade Point Average (CGPA). The CRGPA is computed from all courses the student has taken from the following: (CMPT 120, 128 or 130), (CMPT 125, 129 or 135), CMPT 225, (CMPT 275 or 276), CMPT 295, CMPT 300, CMPT 307, MACM 101, (CMPT 210 or MACM 201), MACM 316. Applicants must have completed at least one MACM course and at least two CMPT courses from this list before applying. At least two courses used in the CRGPA calculation must have been taken at 911³Ô¹Ï.
No course may be included in the average if it is a duplicate of any previous course completed at 911³Ô¹Ï or elsewhere.
The average for admission based on internal transfer is competitive and the school sets competitive averages each term.
The CRGPA minimum average is 2.67 and the CGPA minimum average is 2.40 - the competitive averages will never be below these minima.
Continuation Requirements
Students should maintain a CGPA and a UDGPA of 3.00 in order to continue in the Computing Science honours program.
Program Requirements
Students complete the following, with at least 50 units within the minimum of 60 upper division units, as specified below with a minimum graduation GPA of 3.00. For specific program information, course plans, schedules, etc., consult an
Lower Division Requirements
Students must complete the following curriculum. It is suggested that students complete a recommended schedule of courses within the first two years.
Students complete all of
This course teaches the fundamentals of informative and persuasive communication for professional engineers and computer scientists. A principal goal of this course is to assist students in thinking critically about various contemporary technical, social, and ethical issues. It focuses on communicating technical information clearly and concisely, managing issues of persuasion when communicating with diverse audiences, presentation skills, and teamwork. Students with credit for ENSC 102, ENSC 105W, MSE 101W or SEE 101W may not take CMPT 105W for further credit. Writing.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Tara Immell |
Jan 8 – Apr 12, 2024: Tue, 5:30–6:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 5:30–7:20 p.m. |
Burnaby Burnaby |
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 |
|---|---|---|---|
|
Frederick Popowich |
Jan 8 – Apr 12, 2024: Tue, 1:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |
|
|
Anne Lavergne |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
|
|
Victor Cheung |
Jan 8 – Apr 12, 2024: Mon, 2:30–3:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 2:30–4:20 p.m. |
Surrey Surrey |
|
| D401 |
Jan 8 – Apr 12, 2024: Fri, 8:30–9:20 a.m.
|
Surrey |
|
| D402 |
Jan 8 – Apr 12, 2024: Fri, 8:30–9:20 a.m.
|
Surrey |
|
| D403 |
Jan 8 – Apr 12, 2024: Fri, 9:30–10:20 a.m.
|
Surrey |
|
| D404 |
Jan 8 – Apr 12, 2024: Fri, 9:30–10:20 a.m.
|
Surrey |
|
| D405 |
Jan 8 – Apr 12, 2024: Fri, 10:30–11:20 a.m.
|
Surrey |
|
| D406 |
Jan 8 – Apr 12, 2024: Fri, 10:30–11:20 a.m.
|
Surrey |
|
| D407 |
Jan 8 – Apr 12, 2024: Fri, 11:30 a.m.–12:20 p.m.
|
Surrey |
|
| D408 |
Jan 8 – Apr 12, 2024: Fri, 11:30 a.m.–12: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 8 – Apr 12, 2024: Mon, Wed, Fri, 1:30–2:20 p.m.
|
Burnaby |
|
| D101 |
Jan 8 – Apr 12, 2024: Mon, 2:30–3:20 p.m.
|
Burnaby |
|
| D102 |
Jan 8 – Apr 12, 2024: Mon, 2:30–3:20 p.m.
|
Burnaby |
|
| D103 |
Jan 8 – Apr 12, 2024: Mon, 3:30–4:20 p.m.
|
Burnaby |
|
| D104 |
Jan 8 – Apr 12, 2024: Mon, 3:30–4:20 p.m.
|
Burnaby |
|
| D105 |
Jan 8 – Apr 12, 2024: Mon, 4:30–5:20 p.m.
|
Burnaby |
|
| D106 |
Jan 8 – Apr 12, 2024: Mon, 4:30–5:20 p.m.
|
Burnaby |
|
| D107 |
Jan 8 – Apr 12, 2024: Mon, 12:30–1:20 p.m.
|
Burnaby |
|
| D108 |
Jan 8 – Apr 12, 2024: Mon, 12:30–1:20 p.m.
|
Burnaby |
|
|
Amir Daneshpajouh |
Jan 8 – Apr 12, 2024: Tue, 10:30–11:20 a.m.
Jan 8 – Apr 12, 2024: Thu, 9:30–11:20 a.m. |
Burnaby Burnaby |
|
| D201 |
Jan 8 – Apr 12, 2024: Tue, 8:30–9:20 a.m.
|
Burnaby |
|
| D202 |
Jan 8 – Apr 12, 2024: Tue, 8:30–9:20 a.m.
|
Burnaby |
|
| D203 |
Jan 8 – Apr 12, 2024: Tue, 9:30–10:20 a.m.
|
Burnaby |
|
| D204 |
Jan 8 – Apr 12, 2024: Tue, 9:30–10:20 a.m.
|
Burnaby |
|
| D205 |
Jan 8 – Apr 12, 2024: Tue, 1:30–2:20 p.m.
|
Burnaby |
|
| D206 |
Jan 8 – Apr 12, 2024: Tue, 1:30–2:20 p.m.
|
Burnaby |
|
| D207 |
Jan 8 – Apr 12, 2024: Tue, 2:30–3:20 p.m.
|
Burnaby |
|
| D208 |
Jan 8 – Apr 12, 2024: Tue, 2:30–3:20 p.m.
|
Burnaby |
Probability has become an essential tool in modern computer science with applications in randomized algorithms, computer vision and graphics, systems, data analysis, and machine learning. The course introduces the foundational concepts in probability as required by many modern applications in computing. Prerequisite: MACM 101, MATH 152, CMPT 125 or CMPT 135, and (MATH 240 or MATH 232), all with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Sharan Vaswani |
Jan 8 – Apr 12, 2024: Tue, 10:30–11:20 a.m.
Jan 8 – Apr 12, 2024: Thu, 9:30–11:20 a.m. |
Burnaby Burnaby |
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 8 – Apr 12, 2024: Tue, 4:30–5:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 3:30–5:20 p.m. |
Burnaby Burnaby |
|
| D201 |
Jan 8 – Apr 12, 2024: Thu, 8:30–9:20 a.m.
|
Burnaby |
|
| D202 |
Jan 8 – Apr 12, 2024: Thu, 8:30–9:20 a.m.
|
Burnaby |
|
| D203 |
Jan 8 – Apr 12, 2024: Thu, 9:30–10:20 a.m.
|
Burnaby |
|
| D204 |
Jan 8 – Apr 12, 2024: Thu, 9:30–10:20 a.m.
|
Burnaby |
|
| D205 |
Jan 8 – Apr 12, 2024: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
| D206 |
Jan 8 – Apr 12, 2024: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
| D207 |
Jan 8 – Apr 12, 2024: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D208 |
Jan 8 – Apr 12, 2024: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
|
Anne Lavergne |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 5:30–6:30 p.m.
|
Burnaby |
|
| E101 |
Jan 8 – Apr 12, 2024: Wed, 12:30–1:20 p.m.
|
Burnaby |
|
| E102 |
Jan 8 – Apr 12, 2024: Wed, 12:30–1:20 p.m.
|
Burnaby |
|
| E103 |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
|
Burnaby |
|
| E104 |
Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m.
|
Burnaby |
|
| E105 |
Jan 8 – Apr 12, 2024: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
| E106 |
Jan 8 – Apr 12, 2024: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
| E107 |
Jan 8 – Apr 12, 2024: Wed, 4:30–5:20 p.m.
|
Burnaby |
|
| E108 |
Jan 8 – Apr 12, 2024: Wed, 4:30–5:20 p.m.
|
Burnaby |
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), all with a minimum grade of C-. 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 |
|---|---|---|---|
|
Saba Alimadadi Jani |
Jan 8 – Apr 12, 2024: Tue, 10:30 a.m.–12:20 p.m.
Jan 8 – Apr 12, 2024: Fri, 10:30–11:20 a.m. |
Burnaby Burnaby |
|
|
Bobby Chan |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Fri, 12:30–2:20 p.m. |
Surrey Surrey |
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 or CMPT 135)) or (MATH 151 and CMPT 102 for students in an Applied Physics program), all with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Anne Lavergne |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 9:30–10:20 a.m.
|
Burnaby |
|
| D101 |
Jan 8 – Apr 12, 2024: Fri, 10:30–11:20 a.m.
|
Burnaby |
|
| D102 |
Jan 8 – Apr 12, 2024: Fri, 10:30–11:20 a.m.
|
Burnaby |
|
| D103 |
Jan 8 – Apr 12, 2024: Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D104 |
Jan 8 – Apr 12, 2024: Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D105 |
Jan 8 – Apr 12, 2024: Fri, 12:30–1:20 p.m.
|
Burnaby |
|
| D106 |
Jan 8 – Apr 12, 2024: Fri, 12:30–1:20 p.m.
|
Burnaby |
|
| D107 |
Jan 8 – Apr 12, 2024: Fri, 1:30–2:20 p.m.
|
Burnaby |
|
| D108 |
Jan 8 – Apr 12, 2024: Fri, 1:30–2:20 p.m.
|
Burnaby |
|
|
Arrvindh Shriraman Arrvindh Shriraman |
Jan 8 – Apr 12, 2024: Mon, 12:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Wed, 12:30–1:20 p.m. |
Burnaby Burnaby |
|
| D201 |
Jan 8 – Apr 12, 2024: Thu, 12:30–1:20 p.m.
|
Burnaby |
|
| D202 |
Jan 8 – Apr 12, 2024: Thu, 12:30–1:20 p.m.
|
Burnaby |
|
| D203 |
Jan 8 – Apr 12, 2024: Thu, 12:30–1:20 p.m.
|
Burnaby |
|
| D204 |
Jan 8 – Apr 12, 2024: Thu, 12:30–1:20 p.m.
|
Burnaby |
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 8 – Apr 12, 2024: Wed, 11:30 a.m.–12:20 p.m.
Jan 8 – Apr 12, 2024: Fri, 10:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
|
| D101 |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
|
Burnaby |
|
| D102 |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
|
Burnaby |
|
| D103 |
Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m.
|
Burnaby |
|
| D104 |
Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m.
|
Burnaby |
|
| D105 |
Jan 8 – Apr 12, 2024: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
| D106 |
Jan 8 – Apr 12, 2024: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
| D107 |
Jan 8 – Apr 12, 2024: Wed, 4:30–5:20 p.m.
|
Burnaby |
|
| D108 |
Jan 8 – Apr 12, 2024: Wed, 4:30–5:20 p.m.
|
Burnaby |
|
|
Jan 8 – Apr 12, 2024: Tue, 2:30–4:20 p.m.
Jan 8 – Apr 12, 2024: Fri, 2:30–3:20 p.m. |
Surrey Surrey |
||
| D201 |
Jan 8 – Apr 12, 2024: Tue, 8:30–9:20 a.m.
|
Surrey |
|
| D202 | TBD | ||
| D203 |
Jan 8 – Apr 12, 2024: Tue, 9:30–10:20 a.m.
|
Surrey |
|
| D204 |
Jan 8 – Apr 12, 2024: Tue, 9:30–10:20 a.m.
|
Surrey |
|
| D205 |
Jan 8 – Apr 12, 2024: Tue, 10:30–11:20 a.m.
|
Surrey |
|
| D206 |
Jan 8 – Apr 12, 2024: Tue, 10:30–11:20 a.m.
|
Surrey |
|
| D207 |
Jan 8 – Apr 12, 2024: Tue, 11:30 a.m.–12:20 p.m.
|
Surrey |
|
| D208 |
Jan 8 – Apr 12, 2024: Tue, 11:30 a.m.–12:20 p.m.
|
Surrey |
This is an introductory course in probability and statistics that is designed for Computer Science students. Mainly covers basic probability theory and statistical methods for designing and analyzing computing algorithms and systems. Topics include continuous probability distributions, random variables, multivariate normal distributions, parameter estimation and inference theory, as well as design and analysis of statistical studies, including hypothesis testing and presentation of statistical data. Prerequisite: CMPT 210 with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Gary Parker |
Jan 8 – Apr 12, 2024: Wed, 11:30 a.m.–12:20 p.m.
Jan 8 – Apr 12, 2024: Fri, 10:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
|
| D101 |
Jan 8 – Apr 12, 2024: Wed, 12:30–1: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 911³Ô¹Ï 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 8 – Apr 12, 2024: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
||
| D201 |
Jan 8 – Apr 12, 2024: Tue, 8:30–9:20 a.m.
|
Burnaby |
|
| D202 |
Jan 8 – Apr 12, 2024: Tue, 9:30–10:20 a.m.
|
Burnaby |
|
| D205 |
Jan 8 – Apr 12, 2024: Wed, 12:30–1:20 p.m.
|
Burnaby |
|
| D206 |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
|
Burnaby |
|
| D207 |
Jan 8 – Apr 12, 2024: Wed, 4:30–5:20 p.m.
|
Burnaby |
|
| D208 |
Jan 8 – Apr 12, 2024: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
|
Natalia Kouzniak |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Surrey |
|
| D401 |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
|
Surrey |
|
| D402 |
Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m.
|
Surrey |
|
| D403 |
Jan 8 – Apr 12, 2024: Fri, 2:30–3: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 911³Ô¹Ï 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 911³Ô¹Ï 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 |
|---|---|---|---|
|
Alexander Beams |
Jan 8 – Apr 12, 2024: 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 911³Ô¹Ï 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 |
|---|---|---|---|
|
Katrina Honigs |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
|
Daniel Venn |
Jan 8 – Apr 12, 2024: 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, 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 |
|---|---|---|---|
|
Michael Monagan |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
|
|
Jamie Mulholland |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
|
|
Lyn Ge |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
|
|
Vijaykumar Singh |
Jan 8 – Apr 12, 2024: 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. 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 |
|---|---|---|---|
|
Ralf Wittenberg Elisha Are |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
|
|
Elisha Are |
Jan 8 – Apr 12, 2024: 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 |
|---|---|---|---|
|
Razvan Fetecau |
Jan 8 – Apr 12, 2024: Mon, 4:30–5:20 p.m.
Jan 8 – Apr 12, 2024: Wed, 4:30–6:20 p.m. |
Burnaby 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, 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 |
|---|---|---|---|
|
Fatemeh Panjeh Ali Beik |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
|
Luis Goddyn Brenda Davison |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
|
Justin Chan |
Jan 8 – Apr 12, 2024: 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 |
|---|---|---|---|
|
Razvan Fetecau |
Jan 8 – Apr 12, 2024: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| OP01 | TBD |
** with a grade of at least B+, and with school permission.
Upper Division Requirements
Consult an before commencing upper division requirements.
Students are required to bring the total upper division units in CMPT/MACM courses to at least 50 units within the minimum of 60 upper division units, and an overall total of 132 units are required for the degree, together with a graduation grade point average of at least 3.00.
Students must complete
Covers professional writing in computing science, including format conventions and technical reports. The basis for ethical decision-making and the methodology for reaching ethical decisions concerning computing matters will be studied. Students will survey and write research papers, and both individual and group work will be emphasized. Prerequisite: CMPT 105W and (CMPT 275 or CMPT 276), with a minimum grade of C-. Writing.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Steve Pearce Parsa Rajabi Chris Kerslake |
Jan 8 – Apr 12, 2024: Tue, 10:30–11:20 a.m.
Jan 8 – Apr 12, 2024: Thu, 9:30–11:20 a.m. |
Burnaby Burnaby |
|
|
Parsa Rajabi Chris Kerslake |
Jan 8 – Apr 12, 2024: Tue, 8:30–10:20 a.m.
Jan 8 – Apr 12, 2024: Thu, 8:30–9:20 a.m. |
Surrey Surrey |
Elective Courses
In addition to the courses listed above, students should consult an to plan the remaining required elective courses.
Breadth Requirement
One course in each of the six areas of Table I is required. These courses must include
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 (CMPT 295 or ENSC 254), all with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Harinder Khangura |
Jan 8 – Apr 12, 2024: Tue, 2:30–4:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 2:30–3:20 p.m. |
Surrey Surrey |
|
|
Jan 8 – Apr 12, 2024: Mon, 4:30–7:20 p.m.
|
Burnaby |
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 8 – Apr 12, 2024: Mon, Wed, Fri, 1:30–2:20 p.m.
|
Burnaby |
|
|
Jan 8 – Apr 12, 2024: Tue, 5:30–7:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 5:30–6:20 p.m. |
Surrey Surrey |
||
|
Kay C Wiese |
Jan 8 – Apr 12, 2024: Mon, 2:30–4:20 p.m.
Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m. |
Burnaby Burnaby |
Logical representations of data records. Data models. Studies of some popular file and database systems. Document retrieval. Other related issues such as database administration, data dictionary and security. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)), all with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Jan 8 – Apr 12, 2024: Tue, 4:30–5:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 3:30–5:20 p.m. |
Burnaby Burnaby |
Depth Requirement
Eighteen units of additional CMPT courses numbered CMPT 300 or above must be completed, at least twelve of which must be numbered 400 or above.
These eighteen units must include CMPT 405; at least one other course in the theoretical computing science concentration; and, unless given special permission, cannot include CMPT 415, 416 and 498.
In addition, six units of research courses are required including both of
or
Students must submit a proposal to the Undergraduate Chair, including the name and signature of the supervising faculty member(s). Students must complete a project report and make a project presentation. This course can satisfy the research project requirements for Computing Science honours students. Prerequisite: Students must have completed 90 units, including 15 units of upper division CMPT courses, and have a GPA of at least 3.00. The proposal must be submitted to the Undergraduate Chair at least 15 days in advance of the term. The proposal must be signed by the supervisor(s) and the undergraduate chair.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
| TBD | |||
| TBD | |||
| TBD |
BSc Credential
For a BSc computing science degree, the following additional requirements must be met.
- two additional courses chosen from Table I, II or III
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 8 – Apr 12, 2024: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
|
| D101 |
Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m.
|
Burnaby |
|
| D102 |
Jan 8 – Apr 12, 2024: Wed, 3:30–4:20 p.m.
|
Burnaby |
|
| D103 |
Jan 8 – Apr 12, 2024: Wed, 4:30–5:20 p.m.
|
Burnaby |
|
| D104 |
Jan 8 – Apr 12, 2024: Thu, 9:30–10:20 a.m.
|
Burnaby |
|
| D105 |
Jan 8 – Apr 12, 2024: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
| D106 |
Jan 8 – Apr 12, 2024: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D107 |
Jan 8 – Apr 12, 2024: Thu, 4:30–5:20 p.m.
|
Burnaby |
Areas of Concentration
The primary upper division requirements are structured according to breadth, depth and credential requirements as listed below.
As part of a major program, students may complete one or more concentrations from these six areas: artificial intelligence, computer graphics and multimedia, computing systems, information systems, programming languages and software, and theoretical computing science.
To complete a concentration, students complete the major requirements, including four courses in the corresponding section below - Computing Science Concentrations, at least two of which must be at the 400 division. Courses used to meet the requirements of a concentration may also be used to meet other program requirements.
Table I – Computing Science Concentrations
Artificial Intelligence
A survey of modern approaches for artificial intelligence (AI). Provides an introduction to a variety of AI topics and prepares students for upper-level courses. Topics include: problem solving with search; adversarial game playing; probability and Bayesian networks; machine learning; and applications such as robotics, visual computing and natural language. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)), all with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Steve Pearce Ahmadreza Nezami |
Jan 8 – Apr 12, 2024: Tue, 1:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |
The principles involved in using computers for data acquisition, real-time processing, pattern recognition and experimental control in biology and medicine will be developed. The use of large data bases and simulation will be explored. Prerequisite: Completion of 60 units including one of CMPT 125, 126, 128, 135, with a minimum grade of C- or CMPT 102 with a grade of B or higher.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Ghassan Hamarneh |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
|
Online |
Machine Learning (ML) is the study of computer algorithms that improve automatically through experience. This course introduces students to the theory and practice of machine learning, and covers mathematical foundations, models such as (generalized) linear models, kernel methods and neural networks, loss functions for classification and regression, and optimization methods. Prerequisite: CMPT 310 and MACM 316, both with a minimum grade of C-. Students with credit for CMPT 419 under the title "Machine Learning" may not take this course for further credit.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Jan 8 – Apr 12, 2024: Wed, 3:30–4:50 p.m.
Jan 8 – Apr 12, 2024: Fri, 3:30–4:50 p.m. |
Burnaby Burnaby |
Formal and foundational issues dealing with the representation of knowledge in artificial intelligence systems are covered. Questions of semantics, incompleteness, non-monotonicity and others will be examined. As well, particular approaches, such as procedural or semantic network, may be discussed. Prerequisite: Completion of nine units in Computing Science upper division courses or, in exceptional cases, permission of the instructor.
This course examines the theoretical and applied problems of constructing and modelling systems, which aim to extract and represent the meaning of natural language sentences or of whole discourses, but drawing on contributions from the fields of linguistics, cognitive psychology, artificial intelligence and computing science. Prerequisite: Completion of nine units in Computing Science upper division courses or, in exceptional cases, permission of the instructor.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Angel Chang |
Jan 8 – Apr 12, 2024: Mon, 12:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Wed, 12:30–1:20 p.m. |
Burnaby Burnaby |
Intelligent Systems using modern constraint programming and heuristic search methods. A survey of this rapidly advancing technology as applied to scheduling, planning, design and configuration. An introduction to constraint programming, heuristic search, constructive (backtrack) search, iterative improvement (local) search, mixed-initiative systems and combinatorial optimization. Prerequisite: CMPT 225 with a minimum grade of C-.
Current topics in artificial intelligence depending on faculty and student interest.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Angelica Lim |
Jan 8 – Apr 12, 2024: Tue, 1:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |
|
|
Nicholas Vincent |
Jan 8 – Apr 12, 2024: Mon, 4:30–5:20 p.m.
Jan 8 – Apr 12, 2024: Wed, 4:30–6:20 p.m. |
Burnaby Burnaby |
In machine learning, many recent successes have been achieved using neural networks with several layers, so-called deep neural networks. Convolutional neural nets, autoencoders, recurrent neural nets, long-short term memory networks, and generative adversarial networks will be presented. Students will look at techniques for training them from data, and applications. Prerequisite: CMPT 410 or CMPT 419 (Machine Learning), with a minimum grade of C-. Students with credit for CMPT 728 may not take this course for further credit.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Oliver Schulte |
Jan 8 – Apr 12, 2024: Tue, 8:30–10:20 a.m.
Jan 8 – Apr 12, 2024: Fri, 8:30–9:20 a.m. |
Burnaby Burnaby |
Visual and Interactive Computing
Provides a unified introduction to the fundamentals of computer graphics and computer vision (visual computing). Topics include graphics pipelines, sampling and aliasing, geometric transformations, projection and camera models, meshing, texturing, color theory, image filtering and registration, shading and illumination, raytracing, rasterization, animation, optical flow, and game engines. Prerequisite: CMPT 225 and MATH 232 or 240, all with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Xue Bin Jason Peng Yagiz Aksoy |
Jan 8 – Apr 12, 2024: Wed, 9:30–10:20 a.m.
Jan 8 – Apr 12, 2024: Fri, 8:30–10:20 a.m. |
Burnaby Burnaby |
This course provides a comprehensive study of user interface design. Topics include: goals and principles of UI design (systems engineering and human factors), historical perspective, current paradigms (widget-based, mental model, graphic design, ergonomics, metaphor, constructivist/iterative approach, and visual languages) and their evaluation, existing tools and packages (dialogue models, event-based systems, prototyping), future paradigms, and the social impact of UI. Prerequisite: CMPT 225 and CMPT 263, both with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Victor Cheung |
Jan 8 – Apr 12, 2024: Mon, 12:30–1:20 p.m.
Jan 8 – Apr 12, 2024: Thu, 12:30–2:20 p.m. |
Surrey Surrey |
|
|
Parmit Kaur Chilana |
Jan 8 – Apr 12, 2024: Mon, 12:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Wed, 12:30–1:20 p.m. |
Burnaby Burnaby |
Multimedia systems design, multimedia hardware and software, issues in effectively representing, processing, and retrieving multimedia data such as text, graphics, sound and music, image and video. Prerequisite: CMPT 225 with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Jan 8 – Apr 12, 2024: Mon, 4:30–7:20 p.m.
|
Burnaby |
Computational approaches to image and video understanding in relation to theories, the operation of the human visual system, and practical application areas such as robotics. Topics include image classification, object detection, image segmentation based mostly on deep neural network and to some extent classical techniques, and 3D reconstruction. Also covers state-of-the-art deep neural architectures for computer vision applications, such as metric learning, generative adversarial networks, and recurrent neural networks. Prerequisite: CMPT 361 and MATH 152, both with a minimum grade of C-.
Computational photography is concerned with overcoming the limitations of traditional photography with computation: in optics, sensors, and geometry; and even in composition, style, and human interfaces. The course covers computational techniques to improve the way we process, manipulate, and interact with visual media. The covered topics include intrinsic decomposition, monocular depth estimation, edit propagation, camera geometry and optics, computational apertures, advanced image filtering operations, high-dynamic range, image blending, texture synthesis and inpainting. Prerequisite: CMPT 361 with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Yagiz Aksoy |
Jan 8 – Apr 12, 2024: Wed, 1:30–2:20 p.m.
Jan 8 – Apr 12, 2024: Fri, 12:30–2:20 p.m. |
Burnaby Burnaby |
Covers advanced topics in geometric modelling and processing for computer graphics, such as Bezier and B-spline techniques, subdivision curves and surfaces, solid modelling, implicit representation, surface reconstruction, multi-resolution modelling, digital geometry processing (e.g. mesh smoothing, compression, and parameterization), point-based representation, and procedural modelling. Prerequisite: CMPT 361, MACM 316, both with a minimum grade of C-. Students with credit for CMPT 469 between 2003 and 2007 or equivalent may not take this course for further credit.
Topics and techniques in animation, including: The history of animation, computers in animation, traditional animation approaches, and computer animation techniques such as geometric modelling, interpolation, camera controls, kinematics, dynamics, constraint-based animation, realistic motion, temporal aliasing, digital effects and post production. Prerequisite: CMPT 361 and MACM 316, with a minimum grade of C- or permission of the instructor.
Presents advanced topics in the field of scientific and information visualization. Topics include an introduction to visualization (importance, basic approaches, and existing tools), abstract visualization concepts, human perception, visualization methodology, data representation, 2D and 3D display, interactive visualization, and their use in medical, scientific, and business applications. Prerequisite: CMPT 361, MACM 316, both with a minimum grade of C-.
Current topics in computer graphics depending on faculty and student interest. Prerequisite: CMPT 361 with a minimum grade of C-.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Andrea Tagliasacchi |
Jan 8 – Apr 12, 2024: Fri, 2:30–5:20 p.m.
|
Burnaby |
|
|
Xingdong Yang |
Jan 8 – Apr 12, 2024: Thu, 2:30–5:20 p.m.
|
Burnaby |