Computing Studies
This program provides both part-time and full-time students with an opportunity to understand the fundamentals of computers and programming without necessarily specializing in computing science. Current Ά‘ΟγΤ°AV Computing Science students in Major or Honours programs (or related joint programs) may not apply to this program.
Prerequisite Grade Requirement
Computing science course entry requires a grade of C- or better in each prerequisite course. A minimum 2.40 cumulative grade point average (CGPA) is required for 200, 300 and 400 division computing courses.
Program Requirements
Students complete at least 24 units.
A 2.00 grade point average is required on the CMPT courses that are used for graduation. Only courses completed at Ά‘ΟγΤ°AV are used in this calculation.
Required Courses
Students complete at least 15 units, including either
A rigorous introduction to computing science and computer programming, suitable for students who already have substantial programming background. Topics include: fundamental algorithms and problem solving; abstract data types and elementary data structures; basic object-oriented programming and software design; elements of empirical and theoretical algorithmics; computation and computability; specification and program correctness; and history of computing science. Prerequisite: CMPT 120: Introduction to Computing Science and Programming I. Students with credit for CMPT 125, 128, 130, 135 or higher may not take CMPT 126 for further credit. Quantitative/Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, Wed, Fri, 3:30β4:20 p.m.
|
Burnaby |
|
D101 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 10:30β11:20 a.m.
|
Burnaby |
D102 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 11:30 a.m.β12:20 p.m.
|
Burnaby |
D103 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 12:30β1:20 p.m.
|
Burnaby |
D104 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 1:30β2:20 p.m.
|
Burnaby |
D105 |
Ali Madooei |
Jan 5 β Apr 11, 2016: Mon, 2:30β3:20 p.m.
|
Burnaby |
or both of
An elementary introduction to computing science and computer programming, suitable for students with little or no programming background. Students will learn fundamental concepts and terminology of computing science, acquire elementary skills for programming in a 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 |
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 |
and both of
Digital design concepts are presented in such a way that students will learn how basic logic blocks of a simple computer are designed. Topics covered include: basic Von Neumann computer architecture; an introduction to assembly language programming; combinational logic design; and sequential logic design. Prerequisite: Strongly recommended: MACM 101 and either CMPT 120 or equivalent programming. Students with credit for ENSC 150 or CMPT 290 may not take this course for further credit. Quantitative.
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 |
and one of
Introduction to software engineering techniques used in analysis/design and in software project management. The course centres on a team project involving requirements gathering, object analysis and simple data normalization, use-case-driven user documentation and design followed by implementation and testing. Additionally, there is an introduction to project planning, metrics, quality assurance, configuration management, and people issues. 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 276 may not take this course for further credit.
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 |
and one of
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 |
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 |
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 |
* to aid your choice, prior to enrolment, consult an Applied Sciences Advisor.
Elective Courses
Students complete a total of nine units, including two of
Topics will include user interfaces, objects, event-driven programming, program design, and file and data management. Prerequisite: BC mathematics 12 (or equivalent) or any 100 level MATH course. Students with credit for, or are currently enrolled in a computing science course at the 200 level or higher, or ITEC 240, 241 or 242 may not take this course for further credit. Quantitative.
We shall examine the structure of the Internet and the World Wide Web as well as design and create web sites. Students who have obtained credit for, or are currently enrolled in a CMPT course at the 200 division or higher, CMPT 125, 135 or 170, or IAT 265 or 267 may not take CMPT 165 for further credit. Breadth-Science.
Section | Instructor | Day/Time | Location |
---|---|---|---|
Distance Education | |||
Distance Education | |||
Gregory Baker |
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 |
Introduction to object-oriented software design concepts, the object-oriented features of the C++ language, other advanced C++ features, plus a simple introduction to the fundamentals of graphical user interfaces and the development of windowed applications. Prerequisite: CMPT 125, 126 or 128. Recommended: CMPT 225. Students with credit for CMPT 213 may not take CMPT 212 for further credit.
and one three-unit 300 or 400 division CMPT course.
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 an 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.