Please note:

To view the Fall 2017 Academic Calendar go to http://www.sfu.ca/students/calendar/2017/fall.html

School of Computing Science Simon Fraser University Calendar | Spring 2018

Computing Science Minor

Admission Requirements

Admission is open to all Simon Fraser University students with a major in a discipline other than computing science. Admission is competitive. The admission grade point average (GPA) is established each term, and will never be less than 2.40.

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

Lower Division Requirements

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 David Mitchell
Mo 1:30 PM – 2:20 PM
We 1:30 PM – 2:20 PM
Fr 1:30 PM – 2:20 PM
DFA 300, Burnaby
SSCB 9201, Burnaby
SSCB 9201, Burnaby
D101 David Mitchell
Mo 10:30 AM – 11:20 AM
ASB 9838, Burnaby
D102 David Mitchell
Mo 10:30 AM – 11:20 AM
ASB 9838, Burnaby
D103 David Mitchell
Mo 11:30 AM – 12:20 PM
ASB 9838, Burnaby
D104 David Mitchell
Mo 11:30 AM – 12:20 PM
ASB 9838, Burnaby
D105 David Mitchell
Fr 2:30 PM – 3:20 PM
ASB 9838, Burnaby
D106 David Mitchell
Fr 2:30 PM – 3:20 PM
ASB 9838, Burnaby
D107 David Mitchell
Fr 3:30 PM – 4:20 PM
ASB 9838, Burnaby
D108 David Mitchell
Fr 3:30 PM – 4:20 PM
ASB 9838, Burnaby
E100 Leonid Chindelevitch
Tu 5:30 PM – 8:20 PM
HCC 1900, Vancouver

* Students are responsible for meeting the prerequisites for this course: introductory computer science ((CMPT 125 and 127), CMPT 126 or CMPT 135) and discrete math (MACM 101) or their equivalents.

Upper Division Requirements

Students must complete 15 credits of upper division CMPT or MACM courses, 12 of which must be chosen from the following list. A grade point average of 2.00 in these upper division courses is required.

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.

Section Instructor Day/Time Location
D100 James Delgrande
Mo 11:30 AM – 12:20 PM
We 11:30 AM – 12:20 PM
Fr 11:30 AM – 12:20 PM
AQ 3003, Burnaby
AQ 3159, Burnaby
AQ 3159, Burnaby
D200 Oliver Schulte
Mo, Fr 2:30 PM – 3:20 PM
We 2:30 PM – 3:20 PM
BLU 9660, Burnaby
AQ 3159, Burnaby
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.

Section Instructor Day/Time Location
D100 James Delgrande
Mo 3:30 PM – 4:20 PM
We, Fr 3:30 PM – 4:20 PM
AQ 3005, Burnaby
RCB 8100, Burnaby
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.

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 Richard Zhang
Mo 3:30 PM – 4:20 PM
We 3:30 PM – 4:20 PM
Fr 3:30 PM – 4:20 PM
AQ 3159, Burnaby
AQ 3005, Burnaby
SWH 10041, 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
BLU 10021, Burnaby
BLU 10021, 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 Mark Drew
Mo, We, Fr 9:30 AM – 10:20 AM
AQ 3159, 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.

Section Instructor Day/Time Location
D100 KangKang Yin
Mo, We, Fr 11:30 AM – 12:20 PM
ASB 10900, Burnaby
CMPT 469 - Special Topics in Computer Graphics (3)

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

Section Instructor Day/Time Location
D100 Yasutaka Furukawa
Tu 1:30 PM – 2:20 PM
Th 12:30 PM – 2:20 PM
RCB 8100, Burnaby
BLU 10011, Burnaby

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
D100 Keval Vora
Tu 8:30 AM – 10:20 AM
Th 8:30 AM – 9:20 AM
SWH 10041, Burnaby
SSCC 9002, Burnaby
D200 Harinder Khangura
Mo, We, Fr 11:30 AM – 12:20 PM
SUR 5140, Surrey
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
D100 Ryan Shea
Mo 10:30 AM – 12:20 PM
We 10:30 AM – 11:20 AM
AQ 3159, Burnaby
AQ 3159, Burnaby
D200
Mo, We, Fr 4:30 PM – 5:20 PM
BLU 9660, Burnaby
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
D100 Thomas Shermer
Tu 11:30 AM – 1:20 PM
Th 11:30 AM – 12:20 PM
BLU 9660, Burnaby
BLU 9660, Burnaby
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.

Section Instructor Day/Time Location
D100 Arrvindh Shriraman
We 1:30 PM – 2:20 PM
Fr 12:30 PM – 2:20 PM
SUR 3240, Surrey
SUR 3240, Surrey
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 Qianping Gu
Mo, We 2:30 PM – 3:20 PM
Fr 2:30 PM – 3:20 PM
ASB 10900, Burnaby
RCB 8100, Burnaby
CMPT 479 - Special Topics in Computing Systems (3)

Current topics in computing systems depending on faculty and student interest. Prerequisite: CMPT 300.

Section Instructor Day/Time Location
D100 Keval Vora
Tu 12:30 PM – 1:20 PM
Th 12:30 PM – 2:20 PM
SWH 10051, Burnaby
SWH 10051, 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 353 - Computational Data Science (3)

Basic concepts and programming tools for handling and processing data. Includes data acquisition, cleaning data sources, application of machine learning techniques and data analysis techniques, large-scale computation on a computing cluster. Prerequisite: CMPT 225 and (STAT 101, STAT 270, BUEC 232, ENSC 280, or MSE 210).

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
D100 Martin Ester
Tu 2:30 PM – 4:20 PM
Th 2:30 PM – 3:20 PM
AQ 3159, Burnaby
WMC 3260, Burnaby
E100 Evgenia Ternovska
Th 5:30 PM – 8:20 PM
HCC 1800, Vancouver
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
E100 Ke Wang
We 5:30 PM – 8:20 PM
HCC 1900, Vancouver
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 275 or CMPT 276) and CMPT 354.

Section Instructor Day/Time Location
E100
Th 5:30 PM – 8:20 PM
HCC 1700, 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 213 and (CMPT 276 or 275).

Section Instructor Day/Time Location
D100 Nick Sumner
Mo 12:30 PM – 2:20 PM
We 12:30 PM – 1:20 PM
SUR 5360, Surrey
SUR 5360, Surrey
D101 William Sumner
We 1:30 PM – 2:20 PM
SUR 5060, Surrey
D102 William Sumner
We 3:30 PM – 4:20 PM
SUR 5060, Surrey
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
D100 Thomas Shermer
Tu 4:30 PM – 5:20 PM
Th 3:30 PM – 5:20 PM
AQ 3003, Burnaby
WMC 3260, Burnaby
D200 Toby Donaldson
Mo, We, Fr 9:30 AM – 10:20 AM
SUR 5140, 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)).

Section Instructor Day/Time Location
D100 Rob Cameron
Mo, We, Fr 1:30 PM – 2:20 PM
BLU 9660, Burnaby
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
Mo 2:30 PM – 4:20 PM
We 2:30 PM – 3:20 PM
SUR 5140, Surrey
SUR 5140, 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
Tu 5:30 PM – 8:20 PM
AQ 3159, 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
D100 Rob Cameron
Mo, We, Fr 9:30 AM – 10:20 AM
ASB 10900, Burnaby

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
D100 Valentine Kabanets
Mo 10:30 AM – 11:20 AM
We, Fr 10:30 AM – 11:20 AM
WMC 3260, Burnaby
AQ 3005, Burnaby
D300 Valentine Kabanets
Mo 2:30 PM – 3:20 PM
We 2:30 PM – 3:20 PM
Fr 2:30 PM – 3:20 PM
AQ 3159, Burnaby
SSCC 9002, Burnaby
SSCK 9500, 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.

Section Instructor Day/Time Location
D100 Andrei Bulatov
Mo 10:30 AM – 11:20 AM
We 10:30 AM – 11:20 AM
Fr 10:30 AM – 11:20 AM
AQ 3003, Burnaby
EDB 7618, Burnaby
AQ 3159, Burnaby
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.

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.

Section Instructor Day/Time Location
D100 Binay Bhattacharya
Mo 1:30 PM – 2:20 PM
We 1:30 PM – 2:20 PM
Fr 1:30 PM – 2:20 PM
WMC 3260, Burnaby
AQ 3003, Burnaby
EDB 7618, Burnaby
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.

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, We, Fr 12:30 PM – 1:20 PM
AQ 3181, Burnaby
D101
We 2:30 PM – 3:20 PM
WMC 2830, Burnaby
D102
We 3:30 PM – 4:20 PM
WMC 2830, Burnaby
D103
We 4:30 PM – 5:20 PM
WMC 2830, Burnaby
D104
Th 9:30 AM – 10:20 AM
AQ 5008, Burnaby
D105
Th 10:30 AM – 11:20 AM
AQ 5030, Burnaby
D106
Th 11:30 AM – 12:20 PM
AQ 5007, Burnaby
D107
We 5:30 PM – 6:20 PM
WMC 2830, 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.

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 308 - Linear Optimization (3)

Linear programming modelling. The simplex method and its variants. Duality theory. Post-optimality analysis. Applications and software. Additional topics may include: game theory, network simplex algorithm, and convex sets. Prerequisite: MATH 150, 151, 154, or 157 and MATH 240 or 232. Quantitative.

Section Instructor Day/Time Location
D100 Luis Goddyn
Mo 2:30 PM – 3:20 PM
We 2:30 PM – 3:20 PM
Fr 2:30 PM – 3:20 PM
AQ 3005, Burnaby
WMC 3260, Burnaby
SWH 10041, Burnaby
D101
Tu 2:30 PM – 3:20 PM
WMC 2830, Burnaby
D102
Tu 3:30 PM – 4:20 PM
WMC 2830, Burnaby
D103
Tu 4:30 PM – 5:20 PM
WMC 2830, Burnaby
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.

Co-operative Education and Work Experience

All computing science students are strongly encouraged to explore the opportunities that Work Integrated Learning (WIL) can offer. 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.

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.

Please see Faculty of Applied Sciences Residency Requirements for further information.