Please note: To view the current calendar, go to www.sfu.ca/calendar

Computing Science Major

Bachelor of Science or Bachelor of Arts

The school offers a general program leading to a bachelor of science (BSc) or bachelor of arts (BA) degree. This undergraduate degree is appropriate for many interdisciplinary areas. Visit www.cs.sfu.ca for 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 Simon Fraser University 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. For more information, contact an Applied Sciences Advisor. Internal Transfer Internal transfer allows students to transfer, within Simon Fraser University, from one faculty to another. Once students have completed the 3 qualifying courses they can apply for internal transfer into the School of Computing Science. Simon Fraser University students applying for School of Computing Science admission are selected on the basis of an admission Computing Related Grade Point Average. The CRGPA is calculated over the best three courses chosen as follows. one mathematics course chosen from: MACM 101, 201, MATH 150 (or 151), 152 and 240 (or 232)

one computing course chosen from: CMPT 125 (or 126 or 128, 130 or 135), 150, (or ENSC 150), 225, 250 (or ENSC 250) and 275 (or 276).

one additional mathematics or computing science course chosen from the above lists No course may be included in the average if it is a duplicate of any previous course completed at Simon Fraser University or elsewhere. All three courses must be completed prior to application. For more information, contact an Applied Sciences Advisor.

Continuation Requirements

Students who do not maintain at least a 2.40 CGPA, will be placed on probation. Courses available to probationary students may be limited. Each term, these students must consult an advisor prior to enrolment 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.

Graduation Requirements

A GPA of 2.00 must be obtained for upper division courses used to fulfil the program requirements.

Prerequisite Grade Requirement

Computing science course entry requires a grade of C- or better in each prerequisite course.

A minimum 2.40 CGPA is required for 200, 300 and 400 division CMPT courses. For complete information, contact an Applied Sciences Advisor.

Program Requirements

For specific program information and course plans consult an Applied Sciences Advisor.

Lower Division Requirements

Students must complete the courses listed below. It is suggested that students complete a recommended schedule of courses within the first two years.

Students complete all of

CMPT 120 - Introduction to Computing Science and Programming I (3) 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 and be exposed to diverse fields within, and applications of computing science. Topics will include: pseudocode, data types and control structures, fundamental algorithms, computability and complexity, computer architecture, and history of computing science. Treatment is informal and programming is presented as a problem-solving tool. Prerequisite: BC Math 12 or equivalent is recommended. Students with credit for CMPT 102, 125, 126, 128 or 130 may not take this course for further credit. Quantitative/Breadth-Science. Section Instructor Day/Time Location D100 Anne Lavergne

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

AQ 3181, Burnaby

D101 Anne Lavergne

We 1:30 PM – 2:20 PM

ASB 9838, Burnaby

D102 Anne Lavergne

We 1:30 PM – 2:20 PM

ASB 9838, Burnaby

D103 Anne Lavergne

We 2:30 PM – 3:20 PM

ASB 9838, Burnaby

D104 Anne Lavergne

We 2:30 PM – 3:20 PM

ASB 9838, Burnaby

D105 Anne Lavergne

Th 10:30 AM – 11:20 AM

ASB 9838, Burnaby

D106 Anne Lavergne

Th 10:30 AM – 11:20 AM

ASB 9838, Burnaby

D107 Anne Lavergne

Th 11:30 AM – 12:20 PM

ASB 9838, Burnaby

D108 Anne Lavergne

Th 11:30 AM – 12:20 PM

ASB 9838, Burnaby



CMPT 125 - Introduction to Computing Science and Programming II (3) A rigorous introduction to computing science and computer programming, suitable for students who already have some background in computing science and programming. Intended for students who will major in computing science or a related program. Topics include: fundamental algorithms; elements of empirical and theoretical algorithmics; abstract data types and elementary data structures; basic object-oriented programming and software design; computation and computability; specification and program correctness; and history of computing science. Prerequisite: CMPT120. Co-requisite: CMPT127. Students with credit for CMPT 126,129,135 or CMPT 200 or higher may not take for further credit. Quantitative. Section Instructor Day/Time Location D100 Chun Chan

Mo, We, Fr 3:30 PM – 4:20 PM

AQ 3181, Burnaby



CMPT 225 - Data Structures and Programming (3) 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 and 127), CMPT 129 or CMPT 135)) or (ENSC 251 and ENSC 252). Quantitative. Section Instructor Day/Time Location D100 Thomas Shermer

Mo, We, Fr 1:30 PM – 2:20 PM

SSCB 9201, Burnaby

D101 Thomas Shermer

Fr 12:30 PM – 1:20 PM

ASB 9838, Burnaby

D102 Thomas Shermer

We 2:30 PM – 3:20 PM

ASB 9838, Burnaby

D103 Thomas Shermer

We 3:30 PM – 4:20 PM

ASB 9838, Burnaby

D104 Thomas Shermer

We 4:30 PM – 5:20 PM

ASB 9838, Burnaby

D105 Thomas Shermer

Fr 9:30 AM – 10:20 AM

ASB 9838, Burnaby

D106 Thomas Shermer

Fr 10:30 AM – 11:20 AM

ASB 9838, Burnaby

D107 Thomas Shermer

Fr 11:30 AM – 12:20 PM

ASB 9838, Burnaby

D200 Toby Donaldson

Mo, We, Fr 12:30 PM – 1:20 PM

SUR 3090, Surrey

D201 Toby Donaldson

We 1:30 PM – 2:20 PM

SUR 4080, Surrey

D202 Toby Donaldson

We 2:30 PM – 3:20 PM

SUR 4080, Surrey

D203 Toby Donaldson

We 3:30 PM – 4:20 PM

SUR 4080, Surrey

D204 Toby Donaldson

We 4:30 PM – 5:20 PM

SUR 4080, Surrey



MACM 101 - Discrete Mathematics I (3) Introduction to counting, induction, automata theory, formal reasoning, modular arithmetic. Prerequisite: BC Math 12 (or equivalent), or any of MATH 100, 150, 151, 154, 157. Quantitative/Breadth-Science. Section Instructor Day/Time Location D100 Ramesh Krishnamurti

Mo 9:30 AM – 10:20 AM

We, Fr 9:30 AM – 10:20 AM

EDB 7618, Burnaby

EDB 7618, Burnaby

D101 Ramesh Krishnamurti

We 10:30 AM – 11:20 AM

RCB 6206, Burnaby

D102 Ramesh Krishnamurti

We 11:30 AM – 12:20 PM

AQ 5005, Burnaby

D103 Ramesh Krishnamurti

We 12:30 PM – 1:20 PM

RCB 6206, Burnaby

D104 Ramesh Krishnamurti

We 1:30 PM – 2:20 PM

AQ 2104, Burnaby

D105 Ramesh Krishnamurti

We 2:30 PM – 3:20 PM

AQ 5030, Burnaby

D106 Ramesh Krishnamurti

We 3:30 PM – 4:20 PM

AQ 5004, Burnaby

D107 Ramesh Krishnamurti

We 4:30 PM – 5:20 PM

AQ 5030, Burnaby

D200 Chun Chan

Mo, We, Fr 1:30 PM – 2:20 PM

AQ 3182, Burnaby

D201 Chun Chan

Th 10:30 AM – 11:20 AM

AQ 5005, Burnaby

D202 Chun Chan

Th 11:30 AM – 12:20 PM

AQ 5006, Burnaby

D203 Chun Chan

Th 12:30 PM – 1:20 PM

AQ 5008, Burnaby

D204 Chun Chan

We 3:30 PM – 4:20 PM

AQ 5025, Burnaby

D205 Chun Chan

Th 2:30 PM – 3:20 PM

AQ 5005, Burnaby

D206 Chun Chan

Th 3:30 PM – 4:20 PM

AQ 5005, Burnaby

D207 Chun Chan

Th 4:30 PM – 5:20 PM

AQ 5005, Burnaby

D300 Kay C Wiese

Mo, We, Fr 2:30 PM – 3:20 PM

SUR 3310, Surrey

D301 Kay C Wiese

Tu 8:30 AM – 9:20 AM

SUR 3150, Surrey

D302 Kay C Wiese

Tu 9:30 AM – 10:20 AM

SUR 3150, Surrey

D303 Kay C Wiese

Tu 10:30 AM – 11:20 AM

SUR 3150, Surrey

D304 Kay C Wiese

Tu 11:30 AM – 12:20 PM

SUR 3150, Surrey



and one of

MATH 150 - Calculus I with Review (4) 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 Simon Fraser University Calculus Readiness Test. Students with credit for either MATH 151, 154 or 157 may not take MATH 150 for further credit. Quantitative. Section Instructor Day/Time Location C100 Distance Education D100 Jens-Dietrich Bauch

Mo, Tu, We, Fr 8:30 AM – 9:20 AM

SSCB 9201, Burnaby

D200 Zhaosong Lu

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

We 1:30 PM – 2:20 PM

SUR 3310, Surrey

SUR 3310, Surrey

OP01 TBD OP02 TBD

MATH 151 - Calculus I (3) 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.

and one of

and one of

and one of

Upper Division Requirements

Students complete at least 45 upper division units including

CMPT 376W - Technical Writing and Group Dynamics (3) Covers professional writing in computing science, including format conventions and technical reports. Examines group dynamics, including team leadership, dispute resolution and collaborative writing. Also covers research methods. Prerequisite: CMPT 275 or CMPT 276. Students with credit for CMPT 376 may not take this course for further credit. Writing. Section Instructor Day/Time Location D100 Milan Tofiloski

Mo, We, Fr 12:30 PM – 1:20 PM

AQ 3149, Burnaby

D200 Milan Tofiloski

Mo 3:30 PM – 4:20 PM

We, Fr 3:30 PM – 4:20 PM

AQ 3159, Burnaby

SSCB 9200, Burnaby



Students should consult an academic advisor before commencing upper division requirements.

Elective Courses

In addition to the courses listed above, students should consult an academic advisor to plan the remaining required elective courses.

Breadth Requirement

Five courses from five of the six Table I areas of concentration (see below) must be completed including both of

CMPT 354 is also recommended.

Depth Requirement

Twelve 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).

BSc Credential

For a BSc computing science degree, the following additional requirements must be met.

two additional courses chosen from Table I, Table II or Table III

MACM 316 - Numerical Analysis I (3) 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 Brenda Davison

Mo 12:30 PM – 1:20 PM

We, Fr 12:30 PM – 1:20 PM

RCB IMAGTH, Burnaby

SSCB 9200, Burnaby

D101 Tu 9:30 AM – 10:20 AM

SWH 10061, Burnaby

D102 Tu 10:30 AM – 11:20 AM

AQ 4130, Burnaby

D103 Tu 11:30 AM – 12:20 PM

AQ 2104, Burnaby

D104 Th 9:30 AM – 10:20 AM

AQ 5037, Burnaby

D105 Th 10:30 AM – 11:20 AM

AQ 5018, Burnaby

D106 Th 11:30 AM – 12:20 PM

AQ 5037, Burnaby



BEd Credential

For a major in computing science in conjunction with a BEd program as offered by the Faculty of Education, one additional CMPT course chosen from Table I or Table II must be completed, to total at least 30 upper division units in CMPT courses.

BA Credential

For a BA computing science degree within the Faculty of Applied Sciences, the following additional requirements must be met.

one additional CMPT upper division course chosen from Table I or Table II must be completed bringing the total upper division units in CMPT courses to a minimum of 30 units.

a concentration of 15 units in a Faculty of Arts and Social Sciences discipline (department) including at least six units of upper division credit.

Areas of Concentration

The primary upper division requirements are structured according to breadth, depth and credential requirements as listed above.

As part of a major program, students may complete one or more areas of concentration from the six areas listed in Table I. To complete a concentration, students complete the major requirements, including four courses in the corresponding Area as listed in Table I, 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

CMPT 310 - Artificial Intelligence Survey (3) Provides a unified discussion of the fundamental approaches to the problems in artificial intelligence. The topics considered are: representational typology and search methods; game playing, heuristic programming; pattern recognition and classification; theorem-proving; question-answering systems; natural language understanding; computer vision. Prerequisite: CMPT 225 and (MACM 101 or ENSC 251 and ENSC 252)). Students with credit for CMPT 410 may not take this course for further credit.

CMPT 340 - Biomedical Computing (3) 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 or (102 with a grade of B or higher).

CMPT 411 - Knowledge Representation (3) 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.

CMPT 412 - Computational Vision (3) Computational approaches to image understanding will be discussed in relation to theories about the operation of the human visual system and with respect to practical applications in robotics. Topics will include edge detection, shape from shading, stereopsis, optical flow, Fourier methods, gradient space, three-dimensional object representation and constraint satisfaction. Prerequisite: MATH 152, and nine units in Computing upper division courses or permission of the instructor.

CMPT 413 - Computational Linguistics (3) 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.

CMPT 414 - Model-Based Computer Vision (3) This course covers various topics in computer vision with the emphasis on the model-based approach. Main subjects include 2-D and 3-D representations, matching, constraint relaxation, model-based vision systems. State-of-the-art robot vision systems will be used extensively as study cases. The solid modelling and CAD aspects of this course should also interest students of computer graphics. Prerequisite: MATH 152 and nine units in CMPT upper division courses, or permission of the instructor. Section Instructor Day/Time Location D100 Ze-Nian Li

Mo, We, Fr 12:30 PM – 1:20 PM

RCB 8100, Burnaby



CMPT 417 - Intelligent Systems (3) 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.

CMPT 419 - Special Topics in Artificial Intelligence (3) Current topics in artificial intelligence depending on faculty and student interest.

Computer Graphics and Multimedia

CMPT 361 - Introduction to Computer Graphics (3) This course provides an introduction to the fundamentals of computer graphics. Topics include graphics display and interaction hardware, basic algorithms for 2D primitives, anti-aliasing, 2D and 3D geometrical transformations, 3D projections/viewing, Polygonal and hierarchical models, hidden-surface removal, basic rendering techniques (color, shading, raytracing, radiosity), and interaction techniques. Prerequisite: CMPT 225 and MATH 232 or 240. Section Instructor Day/Time Location D100 Thomas Shermer

Mo 3:30 PM – 4:20 PM

We, Fr 3:30 PM – 4:20 PM

AQ 3153, Burnaby

AQ 3149, Burnaby



CMPT 363 - User Interface Design (3) 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. Section Instructor Day/Time Location D100 Parmit Kaur Chilana

Tu 2:30 PM – 4:20 PM

Th 2:30 PM – 3:20 PM

AQ 3159, Burnaby

AQ 3159, Burnaby



CMPT 365 - Multimedia Systems (3) 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. Section Instructor Day/Time Location D100 Xiaochuan Chen

Mo, We, Fr 2:30 PM – 3:20 PM

AQ 3149, Burnaby



CMPT 461 - Image Synthesis (3) Covers advanced topics and techniques in computer graphics with a focus on image synthesis. Topics include photorealistic rendering, advanced ray tracing, Monte Carlo methods, photon maps, radiosity, light fields, participating media, as well as tone reproduction. Prerequisite: CMPT 361, MACM 201 and 316. Students with credit for CMPT 451 may not take this course for further credit.

CMPT 464 - Geometric Modelling in Computer Graphics (3) 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. Students with credit for CMPT 469 between 2003 and 2007 or equivalent may not take this course for further credit.

CMPT 466 - Animation (3) 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 or permission of the instructor.

CMPT 468 - Introduction to Computer Music and Sound Synthesis (3) An introduction to the fundamentals of digital audio, computer music, basic sound synthesis algorithms, and digital audio effects and processing. Topics include concepts of sound and digital audio representation, basic concepts of digital filtering, fundamentals of spectrum analysis, and sound synthesis techniques. Understanding of theoretical concepts will be consolidated through practical programming assignments in Matlab, however there will also be exposure to various freeware real-time audio programming and sound editing environments. Prerequisite: MATH 152 and one of CMPT 125, 126, 128, 135 or permission of instructor.

Computing Systems

CMPT 431 - Distributed Systems (3) 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 300, 371. Students with credit for CMPT 401 before September 2008 may not take this course for further credit.

CMPT 433 - Embedded Systems (3) 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 behavior 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 250 or CMPT 295) and CMPT 300.

CMPT 471 - Networking II (3) 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 300 and 371. Section Instructor Day/Time Location D100 Mohamed Hefeeda

Mo 2:30 PM – 4:20 PM

We 2:30 PM – 3:20 PM

SSCC 9002, Burnaby

BLU 9660, Burnaby



CMPT 499 - Special Topics in Computer Hardware (3) Current topics in computer hardware depending on faculty and student interest. Prerequisite: CMPT/ENSC 250.

Information Systems

CMPT 441 - Computational Biology (3) 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. Students with credit for CMPT 341 may not take this course for further credit.

CMPT 454 - Database Systems II (3) 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 300 and 354. Section Instructor Day/Time Location D100 Ke Wang

Tu 10:30 AM – 11:20 AM

Th 9:30 AM – 11:20 AM

BLU 9660, Burnaby

BLU 9660, Burnaby

D200 John Edgar

Mo, We, Fr 9:30 AM – 10:20 AM

SUR 5140, Surrey



CMPT 456 - Information Retrieval and Web Search (3) 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.

CMPT 459 - Special Topics in Database Systems (3) Current topics in database and information systems depending on faculty and student interest. Prerequisite: CMPT 354.

CMPT 474 - Web Systems Architecture (3) 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.

Programming Languages and Software

CMPT 373 - Software Development Methods (3) 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.

CMPT 384 - Symbolic Computing (3) 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)).

CMPT 473 - Software Quality Assurance (3) Factors in software quality include functionality, reliability, usability, efficiency, maintainability, and portability. Techniques for assessing the quality of software with respect to such factors, and methods for improving the quality of both software products and software development processes. Prerequisite: CMPT 373. Section Instructor Day/Time Location D100 Nick Sumner

Tu 10:30 AM – 11:20 AM

Th 9:30 AM – 11:20 AM

SUR 5240, Surrey

SUR 5240, Surrey



CMPT 475 - Requirements Engineering (3) 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 276, MACM 201 and 15 units of upper division courses. Recommended: co-op experience. Section Instructor Day/Time Location E100 Dan Ridinger

We 5:30 PM – 8:20 PM

AQ 3150, Burnaby



CMPT 477 - Introduction to Formal Verification (3) 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.

Theoretical Computing Science

CMPT 308 - Computability and Complexity (3) This course introduces students to formal models of computations such as Turing machines and RAMs. Notions of tractability and intractability are discusses both with respect to computability and resource requirements. The relationship of these concepts to logic is also covered. Prerequisite: MACM 201.

CMPT 407 - Computational Complexity (3) Machine models and their equivalences, complexity classes, separation theorems, reductions, Cook's theorem, NP-completeness, the polynomial time hierarchy, boolean circuit models and parallel complexity theory, other topics of interest to the students and instructor. Prerequisite: CMPT 307.

CMPT 408 - Theory of Computing Networks/Communications (3) Network design parameters and goals, dynamic networks and permutations, routing in direct networks, structured communication in direct networks, other topics of interest to the students and instructor. Prerequisite: CMPT 307 and 371.

Table II – Application Courses

Currently no courses.

Table III – Computing Mathematics Courses

MACM 316 - Numerical Analysis I (3) 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 Brenda Davison

Mo 12:30 PM – 1:20 PM

We, Fr 12:30 PM – 1:20 PM

RCB IMAGTH, Burnaby

SSCB 9200, Burnaby

D101 Tu 9:30 AM – 10:20 AM

SWH 10061, Burnaby

D102 Tu 10:30 AM – 11:20 AM

AQ 4130, Burnaby

D103 Tu 11:30 AM – 12:20 PM

AQ 2104, Burnaby

D104 Th 9:30 AM – 10:20 AM

AQ 5037, Burnaby

D105 Th 10:30 AM – 11:20 AM

AQ 5018, Burnaby

D106 Th 11:30 AM – 12:20 PM

AQ 5037, Burnaby



MACM 401 - Introduction to Computer Algebra (3) Data structures and algorithms for mathematical objects. Topics include long integer arithmetic, computing polynomial greatest common divisors, the fast Fourier transform, Hensel's lemma and p-adic methods, differentiation and simplification of formulae, and polynomial factorization. Students will use a computer algebra system such as Maple for calculations and programming. Prerequisite: CMPT 307 or MATH 332 or MATH 340. Quantitative. Section Instructor Day/Time Location D100 Michael Monagan

Tu 2:30 PM – 4:20 PM

Th 2:30 PM – 3:20 PM

AQ 5016, Burnaby

SWH 10051, Burnaby

D101 Michael Monagan

Th 3:30 PM – 4:20 PM

SWH 10051, Burnaby



MACM 442 - Cryptography (3) An introduction to the subject of modern cryptography. Classical methods for cryptography and how to break them, the data encryption standard (DES), the advanced encryption standard (AES), the RSA and ElGammal public key cryptosystems, digital signatures, secure hash functions and pseudo-random number generation. Algorithms for computing with long integers including the use of probabilistic algorithms. Prerequisite: (CMPT 201 or 225) and one of (MATH 340 or 332 or 342); or CMPT 405. Students with credit for MACM 498 between Fall 2003 and Spring 2006 may not take this course for further credit. Quantitative.

MATH 340 - Algebra II: Rings and Fields (3) The integers and mathematical proof. Relations and modular arithmetic. Rings and fields, polynomial rings, the Euclidean algorithm. The complex numbers and the fundamental theorem of algebra. Construction of finite fields, primitive elements in finite fields, and their application. Prerequisite: MATH 240 (or MATH 232 with a grade of at least B). Students with credit for MATH 332 may not take this course for further credit. Quantitative.

MATH 343 - Applied Discrete Mathematics (3) Structures and algorithms, generating elementary combinatorial objects, counting (integer partitions, set partitions, Catalan families), backtracking algorithms, branch and bound, heuristic search algorithms. Prerequisite: MACM 201 (with a grade of at least B-). Recommended: knowledge of a programming language. Quantitative.

Other Courses Per Department Approval

The following courses may be counted in one of the above tables with permission of the school.

CMPT 318 - Special Topics in Computing Science (3) Special topics in computing science at the 300 level. Topics that are of current interest or are not covered in regular curriculum will be offered from time to time depending on availability of faculty and student interest. Prerequisite: CMPT 225.

CMPT 415 - Special Research Projects (3) To be individually arranged. Prerequisite: Permission of Instructor and School.

CMPT 416 - Special Research Projects (3) To be individually arranged. Prerequisite: Permission of the department.

CMPT 496 - Directed Studies (3) Independent study in topics selected in consultation with the supervising instructor(s) that are not covered by existing course offerings. Students must submit a proposal to the undergraduate chair, including the name and signature of the supervising faculty member(s). The proposal must include details of the material to be covered and the work to be submitted. 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.

CMPT 497 - Dual Degree Program Capstone Project (6) 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.

CMPT 498 - Honours Research Project (6) 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.

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 Q - Quantitative 6 Q courses may be lower or upper division B - Breadth 18 Designated Breadth Must be outside the student’s major subject, and may be lower or upper division

6 units Social Sciences: B-Soc

6 units Humanities: B-Hum

6 units Sciences: B-Sci 6 Additional Breadth 6 units outside the student’s major subject (may or may not be B-designated courses, and will likely help fulfil individual degree program requirements)



Students choosing to complete a joint major, joint honours, double major, two extended minors, an extended minor and a minor, or two minors may satisfy the breadth requirements (designated or not designated) with courses completed in either one or both program areas.

Residency Requirements and Transfer Credit

At least half of the program’s total units must be earned through Simon Fraser University study

At least two thirds of the program’s total upper division units must be earned through Simon Fraser University study

At least two thirds of the upper division units in the courses of a school offering (or joint offering) a program must be earned through that school at Simon Fraser University

For information regarding transfer, consult an Applied Sciences Advisor.

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.