Please note:
To view the Fall 2024 Academic Calendar, go to www.sfu.ca/students/calendar/2024/fall.html.
Computing Science Dual Degree Program Major
The school offers a dual degree program (DDP) with Zhejiang University (ZJU) in China that leads to the awarding of two degrees – a bachelor of science from Simon Fraser University (SFU) and, depending on program option, a bachelor of engineering or master of finance from Zhejiang University.
Admission Requirements
BSc/BEng Option
Students are admitted to the BSc/BEng option upon recommendation of the Zhejiang University College of Computer Science and Technology.
BSc/Master of Finance Option
Students may be admitted directly upon entry to Simon Fraser University (secondary school applicants) or indirectly by transfer from another SFU program. Admission is competitive and enrollment is limited. Decisions will be made on the basis of a student's admission average in combination with the required supplemental information. Admission for secondary school applicants is a two-step process; Applicants must meet the competitive admission average calculated on specific secondary school coursework (http://www.sfu.ca/students/admission-requirements.html) and they must also submit the following materials through the DDP website (https://courses.cs.sfu.ca/forms/cmpt-ddp/): (a) a completed Statement of Interest Form (b) a resume outlining school achievements, extracurricular activities, and employment history if any, and (c) names, titles and email addresses of two referees. At least one of the referees must be from a teacher/counselor/principal who can comment on academic potential and maturity for the Dual Degree Program.
The program begins each fall term, but students may be admitted in any term.
Internal transfer applicants should seek the advice of an Applied Sciences advisor for academic and language-placement assessment.
Continuation Requirements
Students who do not maintain at least a 2.40 cumulative grade point average (CGPA), will be placed on probation. Courses available to probationary students may be limited. Each term, these students must consult an advisor prior to enrollment and must achieve either a term 2.40 term GPA or an improved CGPA. Reinstatement from probationary standing occurs when the CGPA improves to 2.40 or better and is maintained.
Students must obtain permission from the department if they wish to complete, for further unit, any course that is a prerequisite for a course the student has already completed with a grade of C- or higher.
Students in the BSc/Master of Finance option must maintain at least a 3.0 CGPA.
Prerequisite Grade Requirement
Computing science course entry requires a grade of C- or better in each prerequisite course. A minimum 2.40 cumulative grade point average is required for upper division computing courses.
Program Overview
BSc/BEng Option
Students complete a four-year curriculum starting with two years including all lower division courses required by the Dual Degree Program curriculum at Zhejiang University (typically 60-66 units). Zhejiang students then travel to Simon Fraser University to complete the remaining two years of course work (typically 54-60 units) including 39-45 units of upper division computing science courses.
BSc/Master of Finance Option
Students complete a five year curriculum starting with 3.5 years of a computing science major or honours program completing at least 102 units at SFU. Students then spend 1.5 years at Zhejiang University completing the remaining requirements of the SFU BSc within the first year and the requirements of the ZJU master of finance thereafter.
Program Requirements
Lower Division Requirements
BSc/BEng Option
After successful completion of the two-year Dual Degree program curriculum at Zhejiang University, students receive 60 units of block DDP credit on the SFU transcript plus up to six additional units of assigned upper division CMPT credit. The block DDP credit includes six units of B-Hum credit, six units of B-Soc credit, six units of B-Sci credit, six units of B-undesignated and six units of Q credit. Zhejiang students must complete six units of W credit at Simon Fraser University.
BSc/Master of Finance Option
Students complete all of*
An introduction to business statistics (descriptive and inferential statistics) with a heavy emphasis on applications and the use of EXCEL. Students will be required to use statistical applications to solve business problems. Corequisite: MATH 150, MATH 151, MATH 154, or MATH 157, with a minimum grade of C-; 15 units. Students with credit for BUEC 232 or ECON 233 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Negar Ganjouhaghighi |
Jan 6 – Apr 9, 2025: Tue, 2:30–5:20 p.m.
|
Burnaby |
D200 |
Hamideh Shokoohian |
Jan 6 – Apr 9, 2025: Wed, 2:30–5:20 p.m.
|
Surrey |
E100 |
Negar Ganjouhaghighi |
Jan 6 – Apr 9, 2025: Thu, 5:30–8:20 p.m.
|
Burnaby |
OP01 |
Jan 6 – Apr 9, 2025: Tue, 9:30 a.m.–2:20 p.m.
|
Burnaby |
|
OP02 |
Jan 6 – Apr 9, 2025: Wed, 9:30 a.m.–2:20 p.m.
|
Burnaby |
|
OP03 |
Jan 6 – Apr 9, 2025: Thu, 9:30 a.m.–2:20 p.m.
|
Burnaby |
|
OP04 |
Jan 6 – Apr 9, 2025: Wed, 10:30 a.m.–12:20 p.m.
|
Surrey |
|
OP05 |
Jan 6 – Apr 9, 2025: Wed, 12:30–2:20 p.m.
|
Surrey |
|
OP06 |
Jan 6 – Apr 9, 2025: Thu, 2:30–7:20 p.m.
|
Burnaby |
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 |
---|---|---|---|
D100 |
Felix Lo |
Jan 6 – Apr 9, 2025: Tue, 2:30–5:20 p.m.
|
Burnaby |
D200 |
Harinder Khangura |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 10:30–11:20 a.m.
|
Surrey |
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 |
---|---|---|---|
D100 |
Diana Cukierman |
Jan 6 – Apr 9, 2025: Mon, 2:30–4:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 2:30–3:20 p.m. |
Burnaby Burnaby |
D200 |
John Edgar |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Surrey |
D201 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Surrey |
D202 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Surrey |
D203 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Surrey |
D204 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Surrey |
D205 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 4:30–5:20 p.m.
|
Surrey |
D206 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 4:30–5:20 p.m.
|
Surrey |
D207 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 5:30–6:20 p.m.
|
Surrey |
D208 |
John Edgar |
Jan 6 – Apr 9, 2025: Tue, 5:30–6:20 p.m.
|
Surrey |
A rigorous introduction to computing science and computer programming, suitable for students who already have some background in computing science and programming. Intended for students who will major in computing science or a related program. Topics include: memory management; fundamental algorithms; formally analyzing the running time of algorithms; abstract data types and elementary data structures; object-oriented programming and software design; specification and program correctness; reading and writing files; debugging tools; shell commands. Prerequisite: CMPT 120 or CMPT 130, with a minimum grade of C-. Students with credit for CMPT 126, 129, 135 or CMPT 200 or higher may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Janice Regan |
Jan 6 – Apr 9, 2025: Tue, 10:30 a.m.–12:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 10:30–11:20 a.m. |
Burnaby Burnaby |
D101 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 9:30–10:20 a.m.
|
Burnaby |
D102 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 9:30–10:20 a.m.
|
Burnaby |
D103 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 10:30–11:20 a.m.
|
Burnaby |
D104 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 10:30–11:20 a.m.
|
Burnaby |
D105 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 12:30–1:20 p.m.
|
Burnaby |
D106 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 12:30–1:20 p.m.
|
Burnaby |
D107 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 1:30–2:20 p.m.
|
Burnaby |
D108 |
Janice Regan |
Jan 6 – Apr 9, 2025: Mon, 1:30–2:20 p.m.
|
Burnaby |
D200 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 3:30–4:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 2:30–4:20 p.m. |
Burnaby Burnaby |
D201 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 9:30–10:20 a.m.
|
Burnaby |
D202 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 9:30–10:20 a.m.
|
Burnaby |
D203 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 10:30–11:20 a.m.
|
Burnaby |
D204 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 10:30–11:20 a.m.
|
Burnaby |
D205 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 12:30–1:20 p.m.
|
Burnaby |
D206 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 12:30–1:20 p.m.
|
Burnaby |
D207 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 1:30–2:20 p.m.
|
Burnaby |
D208 |
Janice Regan |
Jan 6 – Apr 9, 2025: Wed, 1:30–2:20 p.m.
|
Burnaby |
An introduction to a UNIX-like application-OS interface from a programmer's perspective. Introduces operating systems and their interfaces for user-level programs. Students learn how to programmatically interact with an OS efficiently, correctly, and securely. Topics include: command-line tools, programming with memory, processes, threads, IPC, as well as basics of OS security. Prerequisite: (CMPT 125 or CMPT 135) and MACM 101, both with a minimum grade of C-. Students who have taken CMPT 300 first may not then take this course for further credit.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D200 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Mon, Wed, 10:30 a.m.–12:20 p.m.
|
Surrey |
D201 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Wed, 2:30–3:20 p.m.
|
Surrey |
D202 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Wed, 2:30–3:20 p.m.
|
Surrey |
D203 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Wed, 3:30–4:20 p.m.
|
Surrey |
D204 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Wed, 3:30–4:20 p.m.
|
Surrey |
D205 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m.
|
Surrey |
D206 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m.
|
Surrey |
D207 |
Jan 6 – Apr 9, 2025: Mon, 12:30–1:20 p.m.
|
Surrey |
|
D208 |
Jan 6 – Apr 9, 2025: Mon, 12:30–1:20 p.m.
|
Surrey |
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 |
---|---|---|---|
D100 |
Brad Bart |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 1:30–2:20 p.m.
|
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 |
---|---|---|---|
D100 |
David Mitchell |
Jan 6 – Apr 9, 2025: Tue, 1:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |
D101 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 8:30–9:20 a.m.
|
Burnaby |
D102 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 8:30–9:20 a.m.
|
Burnaby |
D103 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 9:30–10:20 a.m.
|
Burnaby |
D104 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 9:30–10:20 a.m.
|
Burnaby |
D105 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 10:30–11:20 a.m.
|
Burnaby |
D106 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 10:30–11:20 a.m.
|
Burnaby |
D107 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D108 |
David Mitchell |
Jan 6 – Apr 9, 2025: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D200 |
John Edgar |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 9:30–10:20 a.m.
|
Surrey |
D201 |
John Edgar |
Jan 6 – Apr 9, 2025: Fri, 2:30–3:20 p.m.
|
Surrey |
D202 |
John Edgar |
Jan 6 – Apr 9, 2025: Fri, 2:30–3:20 p.m.
|
Surrey |
D203 |
John Edgar |
Jan 6 – Apr 9, 2025: Fri, 3:30–4:20 p.m.
|
Surrey |
D204 |
John Edgar |
Jan 6 – Apr 9, 2025: Fri, 3:30–4:20 p.m.
|
Surrey |
D205 |
John Edgar |
Jan 6 – Apr 9, 2025: Fri, 4:30–5:20 p.m.
|
Surrey |
D206 |
John Edgar |
Jan 6 – Apr 9, 2025: Fri, 4:30–5:20 p.m.
|
Surrey |
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 |
---|---|---|---|
D100 |
Saba Alimadadi |
Jan 6 – Apr 9, 2025: Mon, 10:30–11:20 a.m.
Jan 6 – Apr 9, 2025: Thu, 10:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
D200 |
Parsa Rajabi |
Jan 6 – Apr 9, 2025: Tue, 1:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 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 |
---|---|---|---|
D100 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Mon, 4:30–6:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m. |
Burnaby Burnaby |
D101 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Burnaby |
D102 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Burnaby |
D103 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Burnaby |
D104 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Burnaby |
D105 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Burnaby |
D106 |
Arrvindh Shriraman |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Burnaby |
The principal elements of theory concerning money and income, distribution, social accounts, public finance, international trade, comparative systems, and development and growth. Quantitative/Breadth-Soc.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Brian Krauth |
Jan 6 – Apr 9, 2025: Tue, 10:30 a.m.–12:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 10:30–11:20 a.m. |
Burnaby Burnaby |
D101 |
Jan 6 – Apr 9, 2025: Thu, 8:30–9:20 a.m.
|
Burnaby |
|
D102 |
Jan 6 – Apr 9, 2025: Thu, 9:30–10:20 a.m.
|
Burnaby |
|
D103 |
Jan 6 – Apr 9, 2025: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
D104 |
Jan 6 – Apr 9, 2025: Fri, 8:30–9:20 a.m.
|
Burnaby |
|
D105 |
Jan 6 – Apr 9, 2025: Fri, 8:30–9:20 a.m.
|
Burnaby |
|
D106 |
Jan 6 – Apr 9, 2025: Fri, 9:30–10:20 a.m.
|
Burnaby |
|
D107 |
Jan 6 – Apr 9, 2025: Fri, 9:30–10:20 a.m.
|
Burnaby |
|
D110 |
Jan 6 – Apr 9, 2025: Thu, 2:30–3:20 p.m.
|
Burnaby |
|
D114 |
Jan 6 – Apr 9, 2025: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
D200 |
Vasyl Golovetskyy |
Jan 6 – Apr 9, 2025: Wed, 2:30–5:20 p.m.
|
Burnaby |
D201 |
Jan 6 – Apr 9, 2025: Mon, 12:30–1:20 p.m.
|
Burnaby |
|
D202 |
Jan 6 – Apr 9, 2025: Mon, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
D203 |
Jan 6 – Apr 9, 2025: Mon, 10:30–11:20 a.m.
|
Burnaby |
|
D204 |
Jan 6 – Apr 9, 2025: Mon, 9:30–10:20 a.m.
|
Burnaby |
|
D209 |
Jan 6 – Apr 9, 2025: Mon, 12:30–1:20 p.m.
|
Burnaby |
|
D900 |
Yan Yan |
Jan 6 – Apr 9, 2025: Wed, Fri, 10:30 a.m.–12:20 p.m.
|
Surrey |
Introduction to graph theory, trees, induction, automata theory, formal reasoning, modular arithmetic. Prerequisite: BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Brad Bart |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D101 |
Jan 6 – Apr 9, 2025: Thu, 2:30–3:20 p.m.
|
Burnaby |
|
D102 |
Jan 6 – Apr 9, 2025: Thu, 2:30–3:20 p.m.
|
Burnaby |
|
D103 |
Jan 6 – Apr 9, 2025: Thu, 3:30–4:20 p.m.
|
Burnaby |
|
D104 |
Jan 6 – Apr 9, 2025: Thu, 3:30–4:20 p.m.
|
Burnaby |
|
D105 |
Jan 6 – Apr 9, 2025: Thu, 4:30–5:20 p.m.
|
Burnaby |
|
D106 |
Jan 6 – Apr 9, 2025: Thu, 4:30–5:20 p.m.
|
Burnaby |
|
D107 |
Jan 6 – Apr 9, 2025: Thu, 5:30–6:20 p.m.
|
Burnaby |
|
D108 |
Jan 6 – Apr 9, 2025: Thu, 5:30–6:20 p.m.
|
Burnaby |
|
D200 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 9:30–10:20 a.m.
|
Burnaby |
D201 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Burnaby |
D202 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 2:30–3:20 p.m.
|
Burnaby |
D203 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Burnaby |
D204 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 3:30–4:20 p.m.
|
Burnaby |
D205 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 4:30–5:20 p.m.
|
Burnaby |
D206 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 4:30–5:20 p.m.
|
Burnaby |
D207 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 5:30–6:20 p.m.
|
Burnaby |
D208 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Tue, 5:30–6:20 p.m.
|
Burnaby |
D300 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Wed, 3:30–4:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 2:30–4:20 p.m. |
Surrey Surrey |
D301 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 2:30–3:20 p.m.
|
Surrey |
D302 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 2:30–3:20 p.m.
|
Surrey |
D303 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 3:30–4:20 p.m.
|
Surrey |
D304 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 3:30–4:20 p.m.
|
Surrey |
D305 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 4:30–5:20 p.m.
|
Surrey |
D306 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 4:30–5:20 p.m.
|
Surrey |
D307 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 5:30–6:20 p.m.
|
Surrey |
D308 |
Victor Cheung |
Jan 6 – Apr 9, 2025: Mon, 5:30–6:20 p.m.
|
Surrey |
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 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.
Riemann sum, Fundamental Theorem of Calculus, definite, indefinite and improper integrals, approximate integration, integration techniques, applications of integration. First-order separable differential equations and growth models. Sequences and series, series tests, power series, convergence and applications of power series. Prerequisite: MATH 150 or 151 or 155, with a minimum grade of C-; or MATH 154 or 157, with a grade of at least B. Students with credit for MATH 158 or 251 may not take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Nathan Ilten |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
D200 |
Jamie Mulholland |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
D300 |
Seda Albayrak |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 8:30–9:20 a.m.
|
Burnaby |
D400 |
Abraham Punnen |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Surrey |
OP01 | TBD | ||
OP02 | 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 |
---|---|---|---|
D100 |
Luis Goddyn Marni Julie Mishna |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D200 |
Saieed Akbari Feyzaabaadi |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D400 |
Randall Pyke |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 2:30–3:20 p.m.
|
Surrey |
OP01 | TBD | ||
OP02 | TBD |
Linear equations, matrices, determinants. Real and abstract vector spaces, subspaces and linear transformations; basis and change of basis. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. Applications. Subject is presented with an abstract emphasis and includes proofs of the basic theorems. Prerequisite: MATH 150 or 151 or MACM 101, with a minimum grade of C-; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 232 cannot take this course for further credit. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Katrina Honigs |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
OP01 | TBD |
and one of**
A survey of the history of China from the end of the eighteenth century to the present. Breadth-Humanities.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Janice Jeong |
Jan 6 – Apr 9, 2025: Tue, 10:30 a.m.–12:20 p.m.
|
Burnaby |
D101 |
Jan 6 – Apr 9, 2025: Tue, 12:30–1:20 p.m.
|
Burnaby |
|
D102 |
Jan 6 – Apr 9, 2025: Tue, 12:30–1:20 p.m.
|
Burnaby |
|
D103 |
Jan 6 – Apr 9, 2025: Tue, 1:30–2:20 p.m.
|
Burnaby |
|
D104 |
Jan 6 – Apr 9, 2025: Tue, 1:30–2:20 p.m.
|
Burnaby |
|
D105 |
Jan 6 – Apr 9, 2025: Tue, 4:30–5:20 p.m.
|
Burnaby |
|
D106 |
Jan 6 – Apr 9, 2025: Tue, 4:30–5:20 p.m.
|
Burnaby |
An introduction to culture, social structure and the processes of social, economic, and political transformation in contemporary China. Topics may include recent development of Marxism, feminism and neoliberalism in China; Western debates on China's rise and images of China as threat; human rights.
*Course substitutions consistent with those of the computing science major program are acceptable.
**Students may apply to substitute any non-Chinese language course on the elective list of the certificate in Chinese studies, provided that the topic is approved by that program as China-related.
Mandarin Courses
Students with no previous knowledge of Chinese languages complete the following courses.
An intensive introductory course for non-heritage students. Students are expected to master Mandarin Chinese pronunciation and acquaintance with simplified Chinese characters. Basic grammar, everyday conversation topics and Chinese communication style are introduced. Students with credit for CHIN 100 may not take this course for further credit.
Acontinuation of CHIN 180. Students continue to develop skills in listening, speaking, reading and writing in Chinese at a good pace. Lessons also include on-line listening and writing exercises. Prerequisite: CHIN 180, CHIN 100 or equivalent. Corequisite: This course may be taken concurrently with CHIN 180. Students with credit for CHIN 101 may not take this course for further credit.
Intensive training in vocabulary, character acquisition and essentials of grammar. Further development of conversational skills through a communicative approach. Lessons include on-line listening and writing exercises. Prerequisite: CHIN 181, CHIN 101 or equivalent. Students with credit for CHIN 200 may not take this course for further credit.
A continuation of CHIN 280. Students further develop conversational, reading and writing skills in Chinese. Lessons also include on-line listening and writing exercises. Prerequisite: CHIN 280, CHIN 200 or equivalent. Corequisite: This course may be taken concurrently with CHIN 280. Students with credit for CHIN 201 may not take this course for further credit.
Students with some previous knowledge of Chinese languages are assessed for placement by the DDP Chinese Language Instructor. Students may be required to take one or more of the following courses.
An introductory course for heritage language learners who have native or near native speaking ability in Chinese (Mandarin or other dialects), but limited knowledge of written Chinese. Mandarin Chinese phonetic system, basic grammar and 300 Chinese characters are introduced to improve students competences in spoken Mandarin and modern written Chinese. Prerequisite: This course is for students of Chinese origin who have native or near native speaking ability in Chinese (Mandarin or other dialects), but limited knowledge of written Chinese. Breadth-Humanities.
A continuation of CHIN 190. Heritage Chinese students continue to develop competence in Mandarin Chinese, with an emphasis on reading and writing skills. Prerequisite: CHIN 190 or equivalent. This course is for students of Chinese origin who have near native speaking ability in Chinese (Mandarin or other dialects), but limited knowledge of written Chinese. Breadth-Humanities.
Section | Instructor | Day/Time | Location |
---|---|---|---|
B100 |
Cynthia Xie |
TBD | |
B101 |
Cynthia Xie |
Jan 6 – Apr 9, 2025: Thu, 10:30 a.m.–12:20 p.m.
|
Burnaby |
A continuation of CHIN 191. Develops students' communicative competence in spoken Mandarin and modern written Chinese. Classes are conducted entirely in Chinese. Intermediate level materials introduce the basic core of China's culture. By the end of the course, students are expected to have an active vocabulary of approximately 1100 Chinese characters. Prerequisite: CHIN 191 or equivalent. This course is for students of Chinese origin who have near native speaking ability in Chinese (Mandarin or other dialects), but basic knowledge of written Chinese.
A continuation of CHIN 290. Students further develop communicative competence in Chinese language, as well as a deeper understanding of Chinese culture through course materials on Chinese history, mythology and folktales. Prerequisite: CHIN 290 or equivalent. This course is for students of Chinese origin who have near native speaking ability in Chinese (Mandarin or other dialects), but basic knowledge of written Chinese.
Section | Instructor | Day/Time | Location |
---|---|---|---|
B100 |
Cynthia Xie |
TBD | |
B101 |
Cynthia Xie |
Jan 6 – Apr 9, 2025: Thu, 2:30–4:20 p.m.
|
Burnaby |
Introduces specialized vocabulary, sentence patterns, word formation and semantic nuances through popular science readings covering a broad array of subjects such as math, physics, computer science etc. Intended for students of intermediate to advanced Chinese reading, to improve their reading skills for documents with an academic focus. Prerequisite: CHIN 291 or permission of the instructor.
Other Chinese language related courses may be counted toward the language requirements subject to approval by the DDP Chinese Language Instructor.
Upper Division Requirements
BSc/BEng students complete the following upper division courses or equivalent. Students should consult an advisor before commencing upper division requirements. Course substitutions may be approved in consultation with an advisor.
Breadth Requirement
Seven courses from five of the six Table I areas of concentration must be completed including
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 |
---|---|---|---|
D100 |
Qianping Gu |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
D200 |
Jan 6 – Apr 9, 2025: Mon, 12:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 12:30–1:20 p.m. |
Surrey Surrey |
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 |
---|---|---|---|
D100 |
Evgenia Ternovska |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 10:30–11:20 a.m.
|
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 and (MATH 151 or MATH 150), with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 151 (MATH 150).
Section | Instructor | Day/Time | Location |
---|---|---|---|
E100 |
Shervin Shirmohammadi |
Jan 6 – Apr 9, 2025: Mon, 4:30–6:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m. |
Surrey Surrey |
Depth Requirement
12 units of additional CMPT courses numbered CMPT 400 or above must be completed (excluding CMPT 415, 416, and 498, which may be included by special permission).
Additional Requirements
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 |
---|---|---|---|
D100 |
Felix Lo |
Jan 6 – Apr 9, 2025: Thu, 11:30 a.m.–2:20 p.m.
|
Burnaby |
D200 |
Parsa Rajabi |
Jan 6 – Apr 9, 2025: Tue, 8:30–10:20 a.m.
Jan 6 – Apr 9, 2025: Fri, 8:30–9:20 a.m. |
Surrey Surrey |
A presentation of the problems commonly arising in numerical analysis and scientific computing and the basic methods for their solutions. Prerequisite: MATH 152 or 155 or 158, and MATH 232 or 240, and computing experience. Quantitative.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
D101 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Wed, 2:30–3:20 p.m.
|
Burnaby |
D102 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Wed, 3:30–4:20 p.m.
|
Burnaby |
D103 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m.
|
Burnaby |
D104 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Thu, 9:30–10:20 a.m.
|
Burnaby |
D105 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Thu, 10:30–11:20 a.m.
|
Burnaby |
D106 |
Steven Ruuth |
Jan 6 – Apr 9, 2025: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D107 |
Jan 6 – Apr 9, 2025: Thu, 4:30–5:20 p.m.
|
Burnaby |
|
D108 |
Jan 6 – Apr 9, 2025: Thu, 5:30–6:20 p.m.
|
Burnaby |
Students will select one project to be completed in their final year of study. Each student must complete a project report and make a project presentation. The project may include: a research survey, a project implementation, a research paper/report. Prerequisite: Submission of a satisfactory capstone project proposal.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 | TBD |
* CMPT 497 can be replaced by two approved CMPT 400 level courses (six units)
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 |
---|---|---|---|
D100 |
Hang Ma |
Jan 6 – Apr 9, 2025: Tue, 11:30 a.m.–2:20 p.m.
|
Burnaby |
D200 |
Ahmadreza Nezami |
Jan 6 – Apr 9, 2025: Wed, 1:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 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 |
---|---|---|---|
BLS1 |
Ghassan Hamarneh |
Jan 6 – Apr 9, 2025: Wed, 1:30–2:20 p.m.
|
Burnaby |
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 |
---|---|---|---|
D100 |
Ke Li |
Jan 6 – Apr 9, 2025: Mon, 3:30–5:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 3:30–4:20 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 |
---|---|---|---|
D100 |
Angel Chang |
Jan 6 – Apr 9, 2025: Mon, Wed, 3:30–4:50 p.m.
|
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 |
---|---|---|---|
BLS1 |
Ghassan Hamarneh |
Jan 6 – Apr 9, 2025: Wed, 11:30 a.m.–12:20 p.m.
|
Burnaby |
D100 |
Angelica Lim |
Jan 6 – Apr 9, 2025: Mon, 10:30 a.m.–12:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 10:30–11:20 a.m. |
Burnaby Burnaby |
D200 |
Nicholas Vincent |
Jan 6 – Apr 9, 2025: Tue, 1:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |
E300 |
Linyi Li |
Jan 6 – Apr 9, 2025: Tue, 4:30–6:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 5: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 |
---|---|---|---|
D100 |
Wuyang Chen Wuyang Chen |
Jan 6 – Apr 9, 2025: Mon, 12:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 12:30–1:20 p.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 |
---|---|---|---|
D100 |
Xue Bin Jason Peng Yagiz Aksoy |
Jan 6 – Apr 9, 2025: Wed, 11:30 a.m.–12:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 10:30 a.m.–12:20 p.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 |
---|---|---|---|
D100 |
Parmit Kaur Chilana |
Jan 6 – Apr 9, 2025: Tue, 2:30–4:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 2:30–3:20 p.m. |
Burnaby Burnaby |
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 |
---|---|---|---|
E100 |
David Chou |
Jan 6 – Apr 9, 2025: Tue, 4:30–6:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 4:30–5:20 p.m. |
Burnaby 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-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Andrea Tagliasacchi |
Jan 6 – Apr 9, 2025: Thu, 2:30–5:20 p.m.
|
Burnaby |
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 |
---|---|---|---|
D100 |
Yagiz Aksoy |
Jan 6 – Apr 9, 2025: Tue, 8:30–10:20 a.m.
Jan 6 – Apr 9, 2025: Fri, 8:30–9:20 a.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.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
KangKang Yin |
Jan 6 – Apr 9, 2025: Tue, 10:30 a.m.–12:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 10:30–11:20 a.m. |
Burnaby Burnaby |
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-.
Computing Systems
A course teaching the internals of modern operating systems. Topics consist of kernel components of modern OSes, such as system calls, device drivers, virtual memory, scheduling, file systems, synchronization for multi-core, and memory ordering. Prerequisite: CMPT 225, (CMPT 295 or ENSC 254), and (CMPT 201 or ENSC 351), all with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Steven Ko |
Jan 6 – Apr 9, 2025: Tue, 10:30 a.m.–12:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 10:30–11:20 a.m. |
Burnaby Burnaby |
An introduction to the modelling, analysis, and computer simulation of complex systems. Topics include analytic modelling, discrete event simulation, experimental design, random number generation, and statistical analysis. Prerequisite: CMPT 225, (MACM 101 or (ENSC 251 and ENSC 252)) and (STAT 270 or STAT 271), all with a minimum grade of C-.
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 and (MATH 151 or MATH 150), with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 151 (MATH 150).
Section | Instructor | Day/Time | Location |
---|---|---|---|
E100 |
Shervin Shirmohammadi |
Jan 6 – Apr 9, 2025: Mon, 4:30–6:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m. |
Surrey Surrey |
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 or CMPT 210), (CMPT 295 or ENSC 215) and CMPT 225, all with a minimum grade of C-.
Starting from cybersecurity principles, students will learn to protect systems from attacks on data confidentiality, integrity, system availability, and user privacy. By modeling system security, students will learn to find weaknesses in software, hardware, networks, data storage systems, and the Internet, and identify current security practices to protect these systems. Prerequisite: CMPT 201 or CMPT 300, with a minimum grade of C-.
An introduction to distributed systems: systems consisting of multiple physical components connected over a network. Architectures of such systems, ranging from client-server to peer-to-peer. Distributed systems are analyzed via case studies of real network file systems, replicated systems, sensor networks and peer-to-peer systems. Hands-on experience designing and implementing a complex distributed system. Prerequisite: (CMPT 201 or CMPT 300) and CMPT 371, both with a minimum grade of C-. Students with credit for CMPT 401 before September 2008 may not take this course for further credit.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Keval Vora |
Jan 6 – Apr 9, 2025: Fri, 2:30–5:20 p.m.
|
Burnaby |
The basics of embedded system organization, hardware-software co-design, and programmable chip technologies are studied. Formal models and specification languages for capturing and analyzing the behaviour of embedded systems. The design and use of tools for system partitioning and hardware/software co-design implementation, validation, and verification are also studied. Prerequisite: (CMPT 201 or CMPT 300) and CMPT 295, with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Brian Fraser |
Jan 6 – Apr 9, 2025: Mon, 2:30–4:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 2:30–3:20 p.m. |
Surrey Surrey |
Principles of the architecture of computing systems. Topics include: superscalar processor micro-architecture, speculative execution, cache and memory hierarchy, multiprocessors, cache coherence, memory consistency, implications of technology on architecture, parallel architectures (multi-threading, GPUs, vector processors). Prerequisite: CMPT 295 with a minimum grade of C-.
This course covers the fundamentals of higher level network functionality such as remote procedure/object calls, name/address resolution, network file systems, network security and high speed connectivity/bridging/switching. Prerequisite: (CMPT 201 or CMPT 300) and CMPT 371, with a minimum grade of C-.
Current topics in computer hardware depending on faculty and student interest. Prerequisite: CMPT 250 or ENSC 250, with a minimum grade of C-.
Information Systems
Basic concepts and programming tools for handling and processing data. Includes data acquisition, cleaning data sources, application of machine learning techniques and data analysis techniques, large-scale computation on a computing cluster. Prerequisite: CMPT 225 and (BUS 232, STAT 201, STAT 203, STAT 205, STAT 270, STAT 271, ENSC 280, MSE 210, or SEE 241), with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Steven Bergner |
Jan 6 – Apr 9, 2025: Tue, 1:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |
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 |
---|---|---|---|
D100 |
Evgenia Ternovska |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 10:30–11:20 a.m.
|
Burnaby |
Teaches students how to design and implement smartphone applications. Topics include development environment, phone emulator, key programming paradigms, UI design including views, fragments, and activities, data persistence, threads, services, embedded sensors, and location based services (e.g., Google Maps). Concepts are reinforced through programming assignments and group projects. Prerequisite: CMPT 225 with a minimum grade of C-. Students with credit for IAT 359 may not take this course for further credit.
Introduces students to the fundamentals of server-side web development. Students will gain experience working with backend web frameworks, designing and implementing web APIs, and deploying web systems. Students will be introduced to popular back-end frameworks. The course will focus on the design, creating, implementation, and deployment of backend systems, including APIs. Prerequisite: CMPT 272 and CMPT 225, both with a minimum grade of C-. Students with credit for CMPT 470 may not take this course for further credit.
This course introduces students to the computing science principles underlying computational biology. The emphasis is on the design, analysis and implementation of computational techniques. Possible topics include algorithms for sequence alignment, database searching, gene finding, phylogeny and structure analysis. Prerequisite: CMPT 307 with a minimum grade of C-. Students with credit for CMPT 341 may not take this course for further credit.
An advanced course on database systems which covers crash recovery, concurrency control, transaction processing, distributed database systems as the core material and a set of selected topics based on the new developments and research interests, such as object-oriented data models and systems, extended relational systems, deductive database systems, and security and integrity. Prerequisite: (CMPT 201 or CMPT 300) and CMPT 354, with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Tianzheng Wang |
Jan 6 – Apr 9, 2025: Fri, 9:30 a.m.–12:20 p.m.
|
Burnaby |
Introduction to the essentials of information retrieval and the applications of information retrieval in web search and web information systems. Topics include the major models of information retrieval, similarity search, text content search, link structures and web graphics, web mining and applications, crawling, search engines, and some advanced topics such as spam detection, online advertisement, and fraud detection in online auctions. Prerequisite: CMPT 354 with a minimum grade of C-.
Web service based systems are fundamentally different from traditional software systems. The conceptual and methodological differences between a standard software development process and the development of a web service based information system. The technology involved during the construction of their own web service based application in an extensive project. Prerequisite: CMPT 371 with a minimum grade of C-.
Programming Languages and Software
Survey of modern software development methodology. Several software development process models will be examined, as will the general principles behind such models. Provides experience with different programming paradigms and their advantages and disadvantages during software development. Prerequisite: CMPT 276 or 275, with a minimum grade of C-.
Various concepts and principles underlying the design and use of modern programming languages are considered in the context of procedural, object-oriented, functional and logic programming languages. Topics include data and control structuring constructs, facilities for modularity and data abstraction, polymorphism, syntax, and formal semantics. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)), all with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Yuepeng Wang |
Jan 6 – Apr 9, 2025: Tue, 2:30–5:20 p.m.
|
Surrey |
This course considers modelling and programming techniques appropriate for symbolic data domains such as mathematical expressions, logical formulas, grammars and programming languages. Topics include recursive and functional programming style, grammar-based data abstraction, simplification and reduction transformations, conversions to canonical form, environment data structures and interpreters, metaprogramming, pattern matching and theorem proving. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)), all with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Anders Miltner |
Jan 6 – Apr 9, 2025: Tue, 11:30 a.m.–1:20 p.m.
Jan 6 – Apr 9, 2025: Thu, 11:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
Methods for software quality assurance focusing on reliability and security. Test coverage and test data adequacy including combinatorial testing. MC/DC testing, and mutation testing. Security engineering techniques for vulnerability discovery and mitigation including fuzz testing. Testing techniques will be applied to the assessment of external open source software. Prerequisite: (CMPT 275 or CMPT 276) with a minimum grade of C- and 15 upper division CMPT units.
Software succeeds when it is well-matched to its intended purpose. Requirements engineering is the process of discovering that purpose by making requirements explicit and documenting them in a form amenable to analysis, reasoning, and validation, establishing the key attributes of a system prior to its construction. Students will learn methodical approaches to requirements analysis and design specification in early systems development phases, along with best practices and common principles to cope with notoriously changing requirements. Prerequisite: CMPT 275 or CMPT 276, (MACM 201 or CMPT 210) , all with a minimum grade of C- and 15 units of upper division courses. Recommended: Co-op experience.
Section | Instructor | Day/Time | Location |
---|---|---|---|
E100 |
Dan Ridinger |
Jan 6 – Apr 9, 2025: Thu, 4:30–7:20 p.m.
|
Burnaby |
Introduces, at an accessible level, a formal framework for symbolic model checking, one of the most important verification methods. The techniques are illustrated with examples of verification of reactive systems and communication protocols. Students learn to work with a model checking tool. Prerequisite: CMPT 275 or 276, with a minimum grade of C-.
Current topics in programming languages depending on faculty and student interest. Prerequisite: CMPT 383 with a minimum grade of C-.
Theoretical Computing Science
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 |
---|---|---|---|
D100 |
Qianping Gu |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
D200 |
Jan 6 – Apr 9, 2025: Mon, 12:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 12:30–1:20 p.m. |
Surrey Surrey |
Formal models of computation such as automata and Turing machines. Decidability and undecidability. Recursion Theorem. Connections between computability and logic (Gödel’s Incompleteness). Time and space complexity classes. NP-completeness. Prerequisite: (MACM 201 or CMPT 210) with a minimum grade of C-.
The main cryptographic tools and primitives, their use in cryptographic applications; security and weaknesses of the current protocols. The notion of security, standard encryption schemes, digital signatures, zero-knowledge, selected other topics. Prerequisite: (MACM 201 or CMPT 210) with a minimum grade of C-. CMPT 307 and 308 are recommended.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Andrei Bulatov |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
|
Burnaby |
Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NP-completeness, approximation algorithms, selected topics. Prerequisite: CMPT 307 with a minimum grade of C-.
Section | Instructor | Day/Time | Location |
---|---|---|---|
D100 |
Qianping Gu |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 9:30–10:20 a.m.
|
Burnaby |
Mathematical preliminaries; convex hull algorithms; intersection problems; closest-point problems and their applications. Prerequisite: CMPT 307 with a minimum grade of C-.
Study of what is, and is not, efficiently computable with limited resources (time, space, randomness, parallelism, nondeterminism, interaction, and quantum). Complexity classes and connections among them. Interplay between complexity and algorithm design. Prerequisite: CMPT 307 with a minimum grade of C-. CMPT 308 is recommended.
An introductory treatment of quantum computing with an emphasis on quantum algorithms. Topics include the gate model of quantum computation focusing on the design and implementation of quantum algorithms. Basic knowledge of algorithms and complexity will be an asset, but not required. No prior knowledge of physics or quantum mechanics is necessary, only a solid background in linear algebra. Prerequisite: MATH 232 or MATH 240, with a minimum grade of C-. Students who have taken CMPT 409 in Summer 2020 and 2021 under the title "Intro to Quantum Computing" may not take this course for further credit.
Languages, grammars, automata and their applications to natural and formal language processing. Prerequisite: MACM 201. Quantitative.
Minimum Unit and Residency Requirement
Students must complete a minimum of 120 SFU equivalent units overall including at least 45 upper division units. Students must complete at least 54 ZJU units at Zhejiang University including at least 34 computing science core course units. Students must also complete at least 54 units at Simon Fraser University including at least 30 upper division computing science course units.
BSc/Master of Finance Students
By default, the SFU credential awarded by completion of the requirements outlined below is bachelor of science with major in computing science. However, students may choose instead to apply the ZIBS credit towards any other major, joint major, honours or joint honours program offered by the School of Computing Science, provided that the requirements of the chosen program are fully met.
Breadth Requirement
Students complete all of
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 |
---|---|---|---|
D100 |
Qianping Gu |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
D200 |
Jan 6 – Apr 9, 2025: Mon, 12:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 12:30–1:20 p.m. |
Surrey Surrey |
A 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 |
---|---|---|---|
D100 |
Hang Ma |
Jan 6 – Apr 9, 2025: Tue, 11:30 a.m.–2:20 p.m.
|
Burnaby |
D200 |
Ahmadreza Nezami |
Jan 6 – Apr 9, 2025: Wed, 1:30–2:20 p.m.
Jan 6 – Apr 9, 2025: Fri, 12:30–2: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 |
---|---|---|---|
D100 |
Evgenia Ternovska |
Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 10:30–11:20 a.m.
|
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 and (MATH 151 or MATH 150), with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 151 (MATH 150).
Section | Instructor | Day/Time | Location |
---|---|---|---|
E100 |
Shervin Shirmohammadi |
Jan 6 – Apr 9, 2025: Mon, 4:30–6:20 p.m.
Jan 6 – Apr 9, 2025: Wed, 4:30–5:20 p.m. |
Surrey Surrey |
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 |
---|---|---|---|
D100 |
Felix Lo |
Jan 6 – Apr 9, 2025: Thu, 11:30 a.m.–2:20 p.m.
|
Burnaby |
D200 |
Parsa Rajabi |
Jan 6 – Apr 9, 2025: Tue, 8:30–10:20 a.m.
Jan 6 – Apr 9, 2025: Fri, 8:30–9:20 a.m. |
Surrey Surrey |
Dept Requirement
Students complete 24 additional upper division CMPT units, including at least nine units at the CMPT 400 level or above.
The following ZIBS courses may be counted for two units of CMPT 4XX credit each, up to a maximum of six units.
Blockchain and Digital Currency (2)
Distributed Ledger Technology (2)
Cloud Computing and Biometrics (2)
Quantitative Trading and Algorithmic Trading (2)
Study at ZIBS
Students apply by May 30 to begin studies at Zhejiang University in either the following fall term (September start) or spring term (February start - accelerated program).
Students must complete at least 102 units of SFU degree requirements with a cumulative grade point average of at least 3.0 prior to beginning study of Zhejiang University. Students starting in September complete the ZIBS program in two years, students starting in February complete the ZIBS program in 1.5 years.
SFU students will be given advanced credit toward ZIBS requirements based on specific SFU coursework completed. Each year, an updated list of recognized SFU courses that may be counted towards ZIBS requirements will be available from the program advisor.
Credit for ZIBS Course Work
Students will be awarded 18 units of upper division block transfer credit for completion of the first 18 units of course work at ZIBS. This block credit may be counted towards three units of B-Soc breadth requirements as well as six units of undesignated breadth requirements. Depending on the specific ZIBS course taken, up to six units may be counted towards CMPT 4XX requirements as noted above.
Students must complete this ZIBS coursework and all other SFU degree requirements for the BSc within one year of beginning studies at Zhejiang University. Completion of the SFU bachelor’s degree is required before application for the master of finance degree from Zhejiang University.
Co-operative Education and Work Experience
All computing science students are strongly encouraged to explore the opportunities that Work Integrated Learning (WIL) can offer them. Please contact a computing science co-op advisor during your first year of studies to ensure that you have all of the necessary courses and information to help plan for a successful co-op experience.
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 university-wide information.
WQB Graduation Requirements
A grade of C- or better is required to earn W, Q or B credit
Requirement |
Units |
Notes | |
W - Writing |
6 |
Must include at least one upper division course, taken at Simon Fraser University within the student's major subject; two courses (minimum three units each) |
|
Q - Quantitative |
6 |
Q courses may be lower or upper division; two courses (total six units or more) | |
B - Breadth |
18 |
Designated Breadth |
Must be outside the student's major subject, and may be lower or upper division: Two courses (total six units or more) Social Sciences: B-Soc |
6 |
Additional Breadth |
Two courses (total six units or more) outside the student's major subject (may or may not be B-designated courses, and will likely help fulfil individual degree program requirements). Students choosing to complete a joint major, joint honours, double major, two extended minors, an extended minor and a minor, or two minors may satisfy the breadth requirements (designated or not designated) with courses completed in either one or both program areas. |
Tuition and Program Fee
See the Undergraduate Tuition page for more information.