Ά‘ΟγΤ°AV

i Please note:  

To view the current calendar, go to


Ά‘ΟγΤ°AV Calendar | Spring 2016

Computing Science and Linguistics Joint Major

Bachelor of Arts or Bachelor of Science

The School of Computing Science and the Department of Linguistics offer this joint major in the area of computational linguistics. Contact advisors in both departments for permission to enrol. Student enrolment, appeals and graduation processing are administered by the School of Computing Science.

In general, students are expected to meet the requirements of both the department and school with respect to admission and continuation requirements.

Ά‘ΟγΤ°AV Requirements

Linguistics Ά‘ΟγΤ°AV Requirements

An overall 2.25 cumulative GPA and a minimum C+ grade in LING 220 are required for admission to the Linguistics major and all Linguistics joint major programs.

Computing Science Ά‘ΟγΤ°AV 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 Ά‘ΟγΤ°AV

Ά‘ΟγΤ°AV 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. Ά‘ΟγΤ°AV averages are calculated over a set of courses satisfying particular breadth constraints.

Internal Transfer

Internal transfer allows students to transfer, within Ά‘ΟγΤ°AV, from one faculty to another. Once students have completed the three qualifying courses (see below) they can apply for internal transfer into the School of Computing Science. Ά‘ΟγΤ°AV students applying for School of Computing Science admission are selected on the basis of an admission computing-related grade point average (CRGPA). 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, 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 Ά‘ΟγΤ°AV or elsewhere. All three courses must be completed prior to application. Consult an regarding internal transfer.

Continuation Requirements

Students who do not maintain at least a 2.40 CGPA will be placed on the school’s 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 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 2.0 GPA must be obtained for the 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 computing courses. For complete information, contact an

Program Requirements

Lower Division Requirements

Students complete at least 48 units, including 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 Ά‘ΟγΤ°AV 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
Distance Education
Justin Gray
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 8:30–9:20 a.m.
Jan 5 – Apr 11, 2016: Tue, 8:30–9:20 a.m.
Burnaby
Burnaby
Jeremy Chiu
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
Jan 5 – Apr 11, 2016: Wed, 1:30–2:20 p.m.
Surrey
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 Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 154 or 157 may not take MATH 151 for further credit. Quantitative.

MATH 154 - Calculus I for the Biological Sciences (3) **

Designed for students specializing in the biological and medical sciences. Topics include: limits, growth rate and the derivative; elementary functions, optimization and approximation methods, and their applications; mathematical models of biological processes. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B, or MATH 100 with a grade of at least C, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 151 or 157 may not take MATH 154 for further credit. Quantitative.

Section Instructor Day/Time Location
Petr Lisonek
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 8:30–9:20 a.m.
Burnaby
OP01 TBD
MATH 157 - Calculus I for the Social Sciences (3) **

Designed for students specializing in business or the social sciences. Topics include: limits, growth rate and the derivative; logarithmic exponential and trigonometric functions and their application to business, economics, optimization and approximation methods; functions of several variables. Prerequisite: Pre-Calculus 12 (or equivalent) with a grade of at least B, or MATH 100 with a grade of at least C, or achieving a satisfactory grade on the Ά‘ΟγΤ°AV Calculus Readiness Test. Students with credit for either MATH 150, 151 or 154 may not take MATH 157 for further credit. Quantitative.

Section Instructor Day/Time Location
Weiran Sun
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
Burnaby
Natalia Kouzniak
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 12:30–1:20 p.m.
Surrey
OP01 TBD
OP02 TBD

and one of

MATH 152 - Calculus II (3)

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 MATH 154 or 157 with a grade of at least B. Students with credit for MATH 155 or 158 may not take this course for further credit. Quantitative.

Section Instructor Day/Time Location
Brenda Davison
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 8:30–9:20 a.m.
Burnaby
Veselin Jungic
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
Surrey
OP01 TBD
OP02 TBD
MATH 155 - Calculus II for the Biological Sciences (3) **

Designed for students specializing in the biological and medical sciences. Topics include: the integral, partial derivatives, differential equations, linear systems, and their applications; mathematical models of biological processes. Prerequisite: MATH 150, 151 or 154; or MATH 157 with a grade of at least B. Students with credit for MATH 152 or 158 may not take this course for further credit. Quantitative.

Section Instructor Day/Time Location
Luis Goddyn
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 8:30–9:20 a.m.
Burnaby
Natalia Kouzniak
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 9:30–10:20 a.m.
Surrey
OP01 TBD
OP02 TBD
MATH 158 - Calculus II for the Social Sciences (3) **

Theory of integration and its applications; introduction to multivariable calculus with emphasis on partial derivatives and their applications; introduction to differential equations with emphasis on some special first-order equations and their applications to economics and social sciences; continuous probability models; sequences and series. Prerequisite: MATH 150 or 151 or 154 or 157. Students with credit for MATH 152 or 155 may not take MATH 158 for further credit. Quantitative.

Section Instructor Day/Time Location
Luis Goddyn
Jan 5 – Apr 11, 2016: Mon, 4:30–5:20 p.m.
Jan 5 – Apr 11, 2016: Wed, 4:30–6:20 p.m.
Burnaby
Burnaby
OP01 TBD

and one of

MATH 232 - Applied Linear Algebra (3)

Linear equations, matrices, determinants. Introduction to vector spaces and linear transformations and bases. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. An emphasis on applications involving matrix and vector calculations. Prerequisite: MATH 150 or 151; or MACM 101; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 240 make not take this course for further credit. Quantitative.

Section Instructor Day/Time Location
Marni Julie Mishna
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
Burnaby
JF Williams
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 2:30–3:20 p.m.
Surrey
OP01 TBD
OP02 TBD
MATH 240 - Algebra I: Linear Algebra (3)

Linear equations, matrices, determinants. Real and abstract vector spaces, subspaces and linear transformations; basis and change of basis. Complex numbers. Eigenvalues and eigenvectors; diagonalization. Inner products and orthogonality; least squares problems. Applications. Subject is presented with an abstract emphasis and includes proofs of the basic theorems. Prerequisite: MATH 150 or 151; or MACM 101; or MATH 154 or 157, both with a grade of at least B. Students with credit for MATH 232 cannot take this course for further credit. Quantitative.

Section Instructor Day/Time Location
Michael Monagan
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 11:30 a.m.–12:20 p.m.
Burnaby
OPO1 TBD

and one of

BUEC 232 - Data and Decisions I (4)

An introduction to business statistics with a heavy emphasis on applications and the use of EXCEL. Students will be required to use statistical applications to solve business problems. STAT 270, Introduction to Probability and Statistics, will be accepted in lieu of BUEC 232. Prerequisite: MATH 157 and 15 units. MATH 157 may be taken concurrently with BUEC 232. Students with credit for STAT 270 may not take this course for further credit. Quantitative.

Section Instructor Day/Time Location
Lorene Linklater
Jan 5 – Apr 11, 2016: Wed, Fri, 12:30–2:20 p.m.
Burnaby
George Zhang
Jan 5 – Apr 11, 2016: Tue, Thu, 8:30–10:20 a.m.
Surrey
Andrew Flostrand
Jan 5 – Apr 11, 2016: Tue, Thu, 5:30–7:20 p.m.
Burnaby
OP04 Jan 5 – Apr 11, 2016: Tue, 10:30 a.m.–12:20 p.m.
Surrey
OP05 Jan 5 – Apr 11, 2016: Thu, 10:30 a.m.–12:20 p.m.
Surrey
OP09 Jan 5 – Apr 11, 2016: Wed, 2:30–4:20 p.m.
Burnaby
OP10 Jan 5 – Apr 11, 2016: Fri, 2:30–4:20 p.m.
Burnaby
OP11 Jan 5 – Apr 11, 2016: Thu, 2:30–5:20 p.m.
Burnaby
OP12 Jan 5 – Apr 11, 2016: Thu, 7:30–10:20 p.m.
Burnaby
OP13 Jan 5 – Apr 11, 2016: Tue, 7:30–9:20 p.m.
Burnaby
OP14 Jan 5 – Apr 11, 2016: Wed, 7:30–9:20 p.m.
Burnaby
STAT 270 - Introduction to Probability and Statistics (3)

Basic laws of probability, sample distributions. Introduction to statistical inference and applications. Corequisite: MATH 152 or 155 or 158. Students wishing an intuitive appreciation of a broad range of statistical strategies may wish to take STAT 100 first. Quantitative.

Section Instructor Day/Time Location
Distance Education
Tim Swartz
Jan 5 – Apr 11, 2016: Mon, Wed, 9:30–10:20 a.m.
Jan 5 – Apr 11, 2016: Fri, 9:30–10:20 a.m.
Burnaby
Burnaby
Derek Bingham
Jan 5 – Apr 11, 2016: Tue, 8:30–10:20 a.m.
Jan 5 – Apr 11, 2016: Thu, 8:30–9:20 a.m.
Surrey
Surrey
OP01 TBD
OP09 TBD

and one of

COGS 100 - Exploring the Mind (3)

This course provides a basic integrative overview of how cognitive science aspires to integrate the empirical findings, theories, and methods of psychology, neuroscience, linguistics, computing science and philosophy. Prerequisite: Open to all students. Students with credit for COGS 200 may not take COGS 100 for further credit. Breadth-Hum/Social Sci/Science.

Section Instructor Day/Time Location
Mark Blair
Jan 5 – Apr 11, 2016: Wed, 3:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Fri, 2:30–4:20 p.m.
Burnaby
Burnaby
Linda Kaastra
Jan 5 – Apr 11, 2016: Tue, 8:30–10:20 a.m.
Jan 5 – Apr 11, 2016: Thu, 8:30–9:20 a.m.
Surrey
Surrey
Jeremy Turner
Jan 5 – Apr 11, 2016: Wed, 9:30–10:20 a.m.
Jan 5 – Apr 11, 2016: Fri, 8:30–10:20 a.m.
Surrey
Surrey

or one course chosen from the social sciences electives list in the computing science major program's lower division requirements

** with a grade of at least B+, and with school permission

Computing Science Requirements

Students complete at least 21 units, including either 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
Anne Lavergne
Jan 5 – Apr 11, 2016: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
Burnaby
D101 Anne Lavergne
Jan 5 – Apr 11, 2016: Wed, 11:30 a.m.–12:20 p.m.
Burnaby
D102 Anne Lavergne
Jan 5 – Apr 11, 2016: Wed, 11:30 a.m.–12:20 p.m.
Burnaby
D103 Anne Lavergne
Jan 5 – Apr 11, 2016: Wed, 12:30–1:20 p.m.
Burnaby
D104 Anne Lavergne
Jan 5 – Apr 11, 2016: Wed, 12:30–1:20 p.m.
Burnaby
D105 Anne Lavergne
Jan 5 – Apr 11, 2016: Wed, 1:30–2:20 p.m.
Burnaby
D106 Anne Lavergne
Jan 5 – Apr 11, 2016: Wed, 1:30–2:20 p.m.
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, 135 or CMPT 200 or higher may not take for further credit. Quantitative.

Section Instructor Day/Time Location
Bobby Chan
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 3:30–4:20 p.m.
Burnaby
CMPT 127 - Computing Laboratory (3)

Builds on CMPT 120 to give a hands-on introduction to programming in C and C++, the basics of program design, essential algorithms and data structures. Guided labs teach the standard tools and students exploit these ideas to create software that works. To be taken in parallel with CMPT 125. Prerequisite: CMPT 120 or CMPT 128 or CMPT 130. Corequisite CMPT 125.

Section Instructor Day/Time Location
Richard Vaughan
Jan 5 – Apr 11, 2016: Tue, 9:30 a.m.–12:20 p.m.
Burnaby
Richard Vaughan
Jan 5 – Apr 11, 2016: Tue, 12:30–3:20 p.m.
Burnaby
Richard Vaughan
Jan 5 – Apr 11, 2016: Tue, 3:30–6:20 p.m.
Burnaby

or both of

CMPT 130 - Introduction to Computer Programming I (3)

An introduction to computing science and computer programming, using a systems oriented language, such as C or C++. This course introduces basic computing science concepts. Topics will include: elementary data types, control structures, functions, arrays and strings, fundamental algorithms, computer organization and memory management. Prerequisite: BC Math 12 (or equivalent, or any of MATH 100, 150, 151, 154, or 157). Students with credit for CMPT 102, 120, 126, or 128 may not take this course for further credit. Quantitative/Breadth-Science.

Section Instructor Day/Time Location
Karol Swietlicki
Jan 5 – Apr 11, 2016: Mon, Wed, 8:30–9:20 a.m.
Jan 5 – Apr 11, 2016: Fri, 8:30–9:20 a.m.
Surrey
Surrey
D101 Karol Swietlicki
Jan 5 – Apr 11, 2016: Wed, 9:30–10:20 a.m.
Surrey
D102 Karol Swietlicki
Jan 5 – Apr 11, 2016: Wed, 10:30–11:20 a.m.
Surrey
D103 Karol Swietlicki
Jan 5 – Apr 11, 2016: Wed, 11:30 a.m.–12:20 p.m.
Surrey
CMPT 135 - Introduction to Computer Programming II (3)

A second course in systems-oriented programming and computing science that builds upon the foundation set in CMPT 130 using a systems-oriented language such as C or C++. Topics: a review of the basic elements of programming; introduction to object-oriented programming (OOP); techniques for designing and testing programs; use and implementation of elementary data structures and algorithms; introduction to embedded systems programming. Prerequisite: CMPT 130. Students with credit for CMPT 125 or 126 may not take this course for further credit. Quantitative.

Section Instructor Day/Time Location
Scott Kristjanson
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 10:30–11:20 a.m.
Surrey
D101 Scott Kristjanson
Jan 5 – Apr 11, 2016: Mon, 11:30 a.m.–12:20 p.m.
Surrey
D102 Scott Kristjanson
Jan 5 – Apr 11, 2016: Mon, 12:30–1:20 p.m.
Surrey
D103 Scott Kristjanson
Jan 5 – Apr 11, 2016: Mon, 1:30–2:20 p.m.
Surrey

and all of

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 either (CMPT 125 and 127) or CMPT 135) or (ENSC 251 and ENSC 252). Quantitative.

Section Instructor Day/Time Location
Geoffrey Tien
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 9:30–10:20 a.m.
Burnaby
D101 Geoffrey Tien
Jan 5 – Apr 11, 2016: Tue, 9:30–10:20 a.m.
Burnaby
D102 Geoffrey Tien
Jan 5 – Apr 11, 2016: Tue, 10:30–11:20 a.m.
Burnaby
D103 Geoffrey Tien
Jan 5 – Apr 11, 2016: Tue, 11:30 a.m.–12:20 p.m.
Burnaby
D104 Geoffrey Tien
Jan 5 – Apr 11, 2016: Tue, 12:30–1:20 p.m.
Burnaby
D105 Geoffrey Tien
Jan 5 – Apr 11, 2016: Wed, 10:30–11:20 a.m.
Burnaby
D106 Geoffrey Tien
Jan 5 – Apr 11, 2016: Wed, 11:30 a.m.–12:20 p.m.
Burnaby
D107 Geoffrey Tien
Jan 5 – Apr 11, 2016: Wed, 12:30–1:20 p.m.
Burnaby
CMPT 276 - Introduction to Software Engineering (3)

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

Section Instructor Day/Time Location
Bobby Chan
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 12:30–1:20 p.m.
Burnaby
Ted Kirkpatrick
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 3:30–4:20 p.m.
Surrey
CMPT 295 - Introduction to Computer Systems (3)

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: MACM 101- Discrete Mathematics I and CMPT 125- Introduction to Computing Science and Programming II and CMPT 127- Computing Laboratory or CMPT 135- Introduction to Computer Programming II. Students with credits for CMPT 150 or 250 may not take this course for further credit.

Section Instructor Day/Time Location
Anthony Dixon
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 1:30–2:20 p.m.
Burnaby
D101 Anthony Dixon
Jan 5 – Apr 11, 2016: Thu, 10:30–11:20 a.m.
Burnaby
D102 Anthony Dixon
Jan 5 – Apr 11, 2016: Thu, 11:30 a.m.–12:20 p.m.
Burnaby
D103 Anthony Dixon
Jan 5 – Apr 11, 2016: Thu, 12:30–1:20 p.m.
Burnaby
D104 Anthony Dixon
Jan 5 – Apr 11, 2016: Thu, 1:30–2:20 p.m.
Burnaby
D105 Anthony Dixon
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
D106 Anthony Dixon
Jan 5 – Apr 11, 2016: Thu, 3:30–4:20 p.m.
Burnaby
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
Brad Bart
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 10:30–11:20 a.m.
Burnaby
D101 Brad Bart
Jan 5 – Apr 11, 2016: Tue, 1:30–2:20 p.m.
Burnaby
D102 Brad Bart
Jan 5 – Apr 11, 2016: Tue, 2:30–3:20 p.m.
Burnaby
D103 Brad Bart
Jan 5 – Apr 11, 2016: Tue, 3:30–4:20 p.m.
Burnaby
D104 Brad Bart
Jan 5 – Apr 11, 2016: Tue, 4:30–5:20 p.m.
Burnaby
D105 Brad Bart
Jan 5 – Apr 11, 2016: Wed, 2:30–3:20 p.m.
Burnaby
D106 Brad Bart
Jan 5 – Apr 11, 2016: Wed, 3:30–4:20 p.m.
Burnaby
D107 Brad Bart
Jan 5 – Apr 11, 2016: Wed, 4:30–5:20 p.m.
Burnaby
Brad Bart
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 1:30–2:20 p.m.
Burnaby
D201 Brad Bart
Jan 5 – Apr 11, 2016: Thu, 9:30–10:20 a.m.
Burnaby
D202 Brad Bart
Jan 5 – Apr 11, 2016: Thu, 10:30–11:20 a.m.
Burnaby
D203 Brad Bart
Jan 5 – Apr 11, 2016: Thu, 1:30–2:20 p.m.
Burnaby
D204 Brad Bart
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
D205 Brad Bart
Jan 5 – Apr 11, 2016: Thu, 3:30–4:20 p.m.
Burnaby
D206 Brad Bart
Jan 5 – Apr 11, 2016: Fri, 9:30–10:20 a.m.
Burnaby
D207 Brad Bart
Jan 5 – Apr 11, 2016: Fri, 10:30–11:20 a.m.
Burnaby
Steve Pearce
Jan 5 – Apr 11, 2016: Tue, 10:30–11:20 a.m.
Jan 5 – Apr 11, 2016: Thu, 9:30–11:20 a.m.
Surrey
Surrey
D301 Steve Pearce
Jan 5 – Apr 11, 2016: Wed, 2:30–3:20 p.m.
Surrey
D302 Steve Pearce
Jan 5 – Apr 11, 2016: Wed, 3:30–4:20 p.m.
Surrey
D303 Steve Pearce
Jan 5 – Apr 11, 2016: Wed, 4:30–5:20 p.m.
Surrey
D304 Steve Pearce
Jan 5 – Apr 11, 2016: Wed, 5:30–6:20 p.m.
Surrey
MACM 201 - Discrete Mathematics II (3)

A continuation of MACM 101. Topics covered include graph theory, trees, inclusion-exclusion, generating functions, recurrence relations, and optimization and matching. Prerequisite: MACM 101 or (ENSC 251 and one of MATH 232 or MATH 240). Quantitative.

Section Instructor Day/Time Location
Karen Yeats
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 12:30–1:20 p.m.
Burnaby
Abraham Punnen
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 8:30–9:20 a.m.
Surrey
OPO1 TBD
OP02 TBD

Linguistics Requirements

Students complete at least nine units, including all of

LING 220 - Introduction to Linguistics (3)

An introduction to linguistic analysis. Breadth-Social Sciences.

Section Instructor Day/Time Location
Anne Rimrott
Jan 5 – Apr 11, 2016: Wed, 9:30 a.m.–12:20 p.m.
Burnaby
LING 221 - Introduction to Phonetics and Phonology (3)

The principles of phonetic and phonological analysis. Prerequisite: LING 220.

Section Instructor Day/Time Location
Ashley Farris-Trimble
Jan 5 – Apr 11, 2016: Tue, 2:30–5:20 p.m.
Burnaby
LING 222 - Introduction to Syntax (3)

The principles of syntactic analysis. Prerequisite: LING 220.

Section Instructor Day/Time Location
Keir Moulton
Jan 5 – Apr 11, 2016: Wed, 9:30 a.m.–12:20 p.m.
Burnaby

Upper Division Requirements

Computing Science Requirements

Students complete a t least 24 units, including all of

CMPT 300 - Operating Systems I (3)

This course aims to give the student an understanding of what a modern operating system is, and the services it provides. It also discusses some basic issues in operating systems and provides solutions. Topics include multiprogramming, process management, memory management, and file systems. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)).

Section Instructor Day/Time Location
Arrvindh Shriraman
Jan 5 – Apr 11, 2016: Wed, 1:30–2:20 p.m.
Jan 5 – Apr 11, 2016: Fri, 12:30–2:20 p.m.
Surrey
Surrey
Steve Pearce
Jan 5 – Apr 11, 2016: Tue, 5:30–8:20 p.m.
Burnaby
CMPT 307 - Data Structures and Algorithms (3)

Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.

Section Instructor Day/Time Location
Pavol Hell
Jan 5 – Apr 11, 2016: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
Burnaby
CMPT 320 - Social Implications - Computerized Society (3)

An examination of social processes that are being automated and implications for good and evil, that may be entailed in the automation of procedures by which goods and services are allocated. Examination of what are dehumanizing and humanizing parts of systems and how systems can be designed to have a humanizing effect. Prerequisite: A CMPT course and 45 units. Breadth-Science.

Section Instructor Day/Time Location
Steve Pearce
Jan 5 – Apr 11, 2016: Thu, 5:30–8:20 p.m.
Burnaby
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.

and four courses chosen from four distinct concentration areas as listed in Table I. CMPT 308 and 379 are recommended.

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.

Section Instructor Day/Time Location
Brian Funt
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 1:30–2:20 p.m.
Burnaby
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.

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 418 - Computational Cognitive Architecture (3)

Computationally-oriented theories of human cognitive architecture are explored, beginning with neurologically inspired (neural network) models of "low-level" brain processes, and progressing upwards to higher-level symbolic processing, of the kind that occurs in rule-following and problem solving. Arguments concerning the need for modular processing and combinatorially adequate forms of mental representation are examined at length. Prerequisite: CMPT 225. Recommended: CMPT 310.

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
Thomas Shermer
Jan 5 – Apr 11, 2016: Wed, 1:30–2:20 p.m.
Jan 5 – Apr 11, 2016: Fri, 12:30–2:20 p.m.
Burnaby
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.

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
Ze-Nian Li
Jan 5 – Apr 11, 2016: Mon, 2:30–3:20 p.m.
Jan 5 – Apr 11, 2016: Wed, Fri, 2:30–3:20 p.m.
Burnaby
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.

Section Instructor Day/Time Location
Richard Zhang
Jan 5 – Apr 11, 2016: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
Burnaby
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 467 - Visualization (3)

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.

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.

CMPT 469 - Special Topics in Computer Graphics (3)

Current topics in computer graphics depending on faculty and student interest. Prerequisite: CMPT 361.

Computing Systems

CMPT 300 - Operating Systems I (3)

This course aims to give the student an understanding of what a modern operating system is, and the services it provides. It also discusses some basic issues in operating systems and provides solutions. Topics include multiprogramming, process management, memory management, and file systems. Prerequisite: CMPT 225 and (MACM 101 or (ENSC 251 and ENSC 252)).

Section Instructor Day/Time Location
Arrvindh Shriraman
Jan 5 – Apr 11, 2016: Wed, 1:30–2:20 p.m.
Jan 5 – Apr 11, 2016: Fri, 12:30–2:20 p.m.
Surrey
Surrey
Steve Pearce
Jan 5 – Apr 11, 2016: Tue, 5:30–8:20 p.m.
Burnaby
CMPT 305 - Computer Simulation and Modelling (3)

This course is 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.

CMPT 371 - Data Communications and Networking (3)

Data communication fundamentals (data types, rates, and transmission media). Network architectures for local and wide areas. Communications protocols suitable for various architectures. ISO protocols and internetworking. Performance analysis under various loadings and channel error rates. Prerequisite: CMPT 225, (CMPT 150, ENSC 150 or CMPT 295) and MATH 151 (MATH 150). MATH 154 or 157 with a grade of at least B+ may be substituted for MATH 151 (MATH 150).

Section Instructor Day/Time Location
Edward Lo
Jan 5 – Apr 11, 2016: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Surrey
Surrey
Balbir Gill
Jan 5 – Apr 11, 2016: Wed, 5:30–8:20 p.m.
Vancouver
CMPT 379 - Principles of Compiler Design (3)

This course covers the key components of a compiler for a high level programming language. Topics include lexical analysis, parsing, type checking, code generation and optimization. Students will work in teams to design and implement an actual compiler making use of tools such as lex and yacc. Prerequisite: MACM 201, (CMPT 150, CMPT 295 or ENSC 215) and CMPT 225.

Section Instructor Day/Time Location
Maryam Siahbani
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 1:30–2:20 p.m.
Surrey
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
Qianping Gu
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 9:30–10:20 a.m.
Burnaby
CMPT 479 - Special Topics in Computing Systems (3)

Current topics in computing systems depending on faculty and student interest. Prerequisite: CMPT 401 or 431.

Section Instructor Day/Time Location
William Sumner
Jan 5 – Apr 11, 2016: Tue, 11:30 a.m.–1:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 11:30 a.m.–12:20 p.m.
Burnaby
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 301 - Information Systems Management (3)

Topics include strategic planning and use of information systems, current and future technologies, technology assimilation, organizational learning, end-user computing, managing projects and people, managing production operations and networks, evaluating performance and benefits, crisis management and disaster recovery, security and control, financial accountability, and proactive management techniques for a changing environment. Prerequisite: CMPT 225.

CMPT 354 - Database Systems I (3)

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

Section Instructor Day/Time Location
Bobby Chan
Jan 5 – Apr 11, 2016: Wed, 5:30–8:20 p.m.
Burnaby
CMPT 370 - Information System Design (3)

This course focuses on the computer-related problems of information system design and procedures of design implementation. Well-established design methodologies will be discussed, and case studies will be used to illustrate various techniques of system design. Prerequisite: CMPT 275 or 276; CMPT 354.

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
Ke Wang
Jan 5 – Apr 11, 2016: Tue, 10:30–11:20 a.m.
Jan 5 – Apr 11, 2016: Thu, 9:30–11:20 a.m.
Burnaby
Burnaby
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 470 - Web-based Information Systems (3)

This course examines: two-tier/multi-tier client/server architectures; the architecture of a Web-based information system; web servers/browser; programming/scripting tools for clients and servers; database access; transport of programming objects; messaging systems; security; and applications (such as e-commerce and on-line learning). Prerequisite: CMPT 354.

Section Instructor Day/Time Location
Gregory Baker
Jan 5 – Apr 11, 2016: Thu, 5:30–8:20 p.m.
Vancouver
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 375 - Mathematical Foundations of Software Technology (3)

Abstraction principles and formalization techniques for modelling software systems in early design phases. Design is a creative activity calling for abstract models that facilitate reasoning about the key system attributes to ensure that these attributes are properly established prior to actually building a system. The focus is on specification and validation techniques rather than on formal verification. Prerequisite: (MACM 101 or (ENSC 251 and ENSC 252)) and MACM 201. Recommended CMPT 275 or 276.

CMPT 383 - Comparative Programming Languages (3)

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

Section Instructor Day/Time Location
Toby Donaldson
Jan 5 – Apr 11, 2016: Mon, Wed, Fri, 12:30–1:20 p.m.
Surrey
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
William Sumner
Jan 5 – Apr 11, 2016: Mon, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Wed, 2:30–3:20 p.m.
Surrey
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
Dan Ridinger
Jan 5 – Apr 11, 2016: Wed, 5:30–8:20 p.m.
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.

CMPT 489 - Special Topics in Programming Language (3)

Current topics in programming languages depending on faculty and student interest. Prerequisite: CMPT 383.

Section Instructor Day/Time Location
Rob Cameron
Jan 5 – Apr 11, 2016: Tue, 4:30–5:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 3:30–5:20 p.m.
Surrey
Surrey

Theoretical Computing Science

CMPT 307 - Data Structures and Algorithms (3)

Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.

Section Instructor Day/Time Location
Pavol Hell
Jan 5 – Apr 11, 2016: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
Burnaby
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 404 - Cryptography and Cryptographic Protocols (3)

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. CMPT 307 and 308 are recommended.

CMPT 405 - Design and Analysis of Computing Algorithms (3)

Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NP-completeness, approximation algorithms, selected topics. Prerequisite: CMPT 307.

Section Instructor Day/Time Location
Petra Berenbrink
Jan 5 – Apr 11, 2016: Mon, Wed, 10:30–11:20 a.m.
Jan 5 – Apr 11, 2016: Fri, 10:30–11:20 a.m.
Burnaby
Burnaby
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.

CMPT 409 - Special Topics in Theoretical Computing Science (3)

Current topics in theoretical computing science depending on faculty and student interest. Prerequisite: CMPT 307.

MACM 300 - Introduction to Formal Languages and Automata with Applications (3)

Languages, grammars, automata and their applications to natural and formal language processing. Prerequisite: MACM 201. Quantitative.

Linguistics Requirements

Students complete at least 21 units, including both of

LING 321 - Phonology (3)

An overview of theoretical principles in phonology. Prerequisite: LING 221.

Section Instructor Day/Time Location
John Alderete
Jan 5 – Apr 11, 2016: Tue, 4:30–5:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 3:30–5:20 p.m.
Burnaby
Burnaby
LING 322 - Syntax (3)

Introduces theories of sentence structure. Prerequisite: LING 222.

Section Instructor Day/Time Location
Keir Moulton
Jan 5 – Apr 11, 2016: Tue, 8:30–10:20 a.m.
Jan 5 – Apr 11, 2016: Thu, 8:30–9:20 a.m.
Burnaby
Burnaby

and one of

LING 400 - Formal Linguistics (3)

Formal systems and their relation to linguistic methods and theory. Topics include the mathematical properties of natural languages, and rigorously defined frameworks for linguistic analysis and their formal properties. Prerequisite: LING 322. Recommended: PHIL 210. Quantitative.

MACM 300 - Introduction to Formal Languages and Automata with Applications (3)

Languages, grammars, automata and their applications to natural and formal language processing. Prerequisite: MACM 201. Quantitative.

and 12 units chosen from

LING 323 - Morphology (3)

Word structure in natural languages and its relationship to phonological and syntactic levels of grammar. Prerequisite: LING 221, 222 and one of LING 301W, 309W or 482W.

Section Instructor Day/Time Location
Dean Mellow
Jan 5 – Apr 11, 2016: Wed, 11:30 a.m.–12:20 p.m.
Jan 5 – Apr 11, 2016: Fri, 10:30 a.m.–12:20 p.m.
Burnaby
Burnaby
LING 324 - Semantics (3)

Basic formal aspects of meaning (e.g. compositional semantics, truth conditional semantics and quantification in natural language) and how they are distinguished from pragmatic aspects of meaning. Prerequisite: LING 222. Quantitative.

LING 330 - Phonetics (3)

A survey of methods of speech sound description and transcription. Prerequisite: LING 221.

Section Instructor Day/Time Location
Marion Caldecott
Jan 5 – Apr 11, 2016: Tue, 2:30–5:20 p.m.
Burnaby
LING 401 - Topics in Phonetics (3)

Advanced training in speech sound description and analysis in the impressionistic and instrumental modes. Prerequisite: LING 330.

Section Instructor Day/Time Location
Murray Munro
Jan 5 – Apr 11, 2016: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 11, 2016: Thu, 2:30–3:20 p.m.
Burnaby
Burnaby
LING 480 - Topics in Linguistics I (3) *

Investigation of a selected area of linguistic research. Prerequisite: Requirements will vary according to the topic offered.

LING 481 - Topics in Linguistics II (3) *

Investigation of a selected area of linguistic research. Prerequisite: Requirements will vary according to the topic offered.

Section Instructor Day/Time Location
John Alderete
Jan 5 – Apr 11, 2016: Mon, 2:30–5:20 p.m.
Burnaby

* when offered with a suitable topic

Elective Courses

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

Other Requirements

Depending on the student’s choice, either a bachelor of arts from the Faculty of Arts and Social Sciences (FASS), or a bachelor of science from the Faculty of Applied Sciences (FAS) will be awarded. Students must fulfil their chosen faculty’s distinct requirements.

Faculty of Arts and Social Sciences Degree Requirements

For all bachelor of arts (BA) programs, students complete 120 units, which includes

  • at least 60 units that must be completed at Ά‘ΟγΤ°AV
  • at least 45 upper division units, of which at least 30 upper division units must be completed at Ά‘ΟγΤ°AV
  • at least 65 units (including 21 upper division units) in Faculty of Arts and Social Sciences courses
  • satisfaction of the writing, quantitative, and breadth requirements
  • an overall cumulative grade point average (CGPA) and upper division CGPA of at least 2.0, and a program (major, joint major, extended minor, minor) CGPA and upper division CGPA of at least 2.0

Writing, Quantitative, and Breadth Requirements

Students admitted to Ά‘ΟγΤ°AV beginning in the fall 2006 term must meet writing, quantitative and breadth requirements as part of any degree program they may undertake. See 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 Ά‘ΟγΤ°AV 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

The University's residency requirement stipulates that, in most cases, total transfer and course challenge credit may not exceed 60 units, and may not include more than 15 units as upper division work.

  • At least half of the program's total units must be earned through Ά‘ΟγΤ°AV study
  • At least two thirds of the program's total upper division units must be earned through Ά‘ΟγΤ°AV study
  • At least two thirds of the upper division units in the courses of a school offering (or joint offering) must be earned through that school at Ά‘ΟγΤ°AV

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