Program Requirements
This program provides a broad introduction to the principles of computer science and covers in depth the design and development of software systems.
Students may complete this program with a maximum of 63 credits or a minimum of 60 credits if they are exempt from taking COMP 202.
Required Courses (39 credits)
* Students who have sufficient knowledge in a programming language do not need to take COMP 202.
** Students may select either COMP 310 or ECSE 427, but not both.

COMP 202 Foundations of Programming (3 credits) *
Overview
Computer Science (Sci) : Introduction to programming in a modern highlevel language, modular software design and debugging. Programming concepts are illustrated using a variety of application areas.
Terms: Fall 2013, Winter 2014, Summer 2014
Instructors: Daniel Pomerantz, Jonathan Tremblay (Fall) Bettina Kemme, Jonathan Tremblay (Winter)
 3 hours
 Prerequisite: a CEGEP level mathematics course
 Restrictions: COMP 202 and COMP 208 cannot both be taken for credit. COMP 202 is intended as a general introductory course, while COMP 208 is intended for students interested in scientific computation. COMP 202 cannot be taken for credit with or after COMP 250

COMP 206 Introduction to Software Systems (3 credits)
Overview
Computer Science (Sci) : Comprehensive overview of programming in C, use of system calls and libraries, debugging and testing of code; use of developmental tools like make, version control systems.
Terms: Fall 2013, Winter 2014
Instructors: Joseph P Vybihal (Fall) Joseph P Vybihal (Winter)
 3 hours
 Prerequisite: COMP 202 or COMP 250

COMP 250 Introduction to Computer Science (3 credits)
Overview
Computer Science (Sci) : An introduction to the design of computer algorithms, including basic data structures, analysis of algorithms, and establishing correctness of programs. Overview of topics in computer science.
Terms: Fall 2013, Winter 2014
Instructors: Mathieu Blanchette (Fall) Doina Precup, Mathieu Blanchette (Winter)
 3 hours
 Prerequisites: Familiarity with a high level programming language and CEGEP level Math.
 Restrictions: COMP 203 and COMP 250 are considered to be equivalent from a prerequisite point of view, and cannot both be taken for credit.

COMP 251 Algorithms and Data Structures (3 credits)
Overview
Computer Science (Sci) : Introduction to algorithm design and analysis. Graph algorithms, greedy algorithms, data structures, dynamic programming, maximum flows.
Terms: Fall 2013, Winter 2014
Instructors: Prakash Panangaden, Gheorghe Comanici (Fall) Michael Langer (Winter)
 3 hours
 Prerequisite: COMP 250 or COMP 203.
 Restrictions: Not open to students who have taken or are taking COMP 252.

COMP 273 Introduction to Computer Systems (3 credits)
Overview
Computer Science (Sci) : Number representations, combinational and sequential digital circuits, MIPS instructions and architecture datapath and control, caches, virtual memory, interrupts and exceptions, pipelining.
Terms: Fall 2013, Winter 2014
Instructors: Joseph P Vybihal (Fall) Paul Kry (Winter)
 3 hours
 Corequisite: COMP 206.

COMP 302 Programming Languages and Paradigms (3 credits)
Overview
Computer Science (Sci) : Programming language design issues and programming paradigms. Binding and scoping, parameter passing, lambda abstraction, data abstraction, type checking. Functional and logic programming.
Terms: Fall 2013, Winter 2014
Instructors: Brigitte Pientka (Fall) Prakash Panangaden (Winter)
 3 hours
 Prerequisite: COMP 250

COMP 303 Software Development (3 credits)
Overview
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for objectoriented software development: encapsulation, design patterns, unit testing, etc.
Terms: Fall 2013
Instructors: Martin Robillard (Fall)
 3 hours
 Prerequisites: COMP 206, COMP 250.
 The course involves a significant project.

COMP 310 Operating Systems (3 credits) **
Overview
Computer Science (Sci) : Control and scheduling of large information processing systems. Operating system software  resource allocation, dispatching, processors, access methods, job control languages, main storage management. Batch processing, multiprogramming, multiprocessing, time sharing.
Terms: Fall 2013, Winter 2014
Instructors: Xue Liu (Fall) Muthucumaru Maheswaran (Winter)
 3 hours
 Prerequisite: COMP 273

COMP 361D1 Software Engineering Project (3 credits)
Overview
Computer Science (Sci) : Software development process in practice: requirement elicitation and analysis, software design, implementation, integration, test planning, and maintenance. Application of the core concepts and techniques through the realization of a large software system.
Terms: Fall 2013
Instructors: Jorg Andreas Kienzle (Fall)
 Prerequisites: COMP 206, COMP 250
 Corequisite: COMP 303
 Restriction: Not open to students who have taken the 3 credit version of COMP 361.
 Students must register for both COMP 361D1 and COMP 361D2
 No credit will be given for this course unless both COMP 361D1 and COMP 361D2 are successfully completed in consecutive terms

COMP 361D2 Software Engineering Project (3 credits)
Overview
Computer Science (Sci) : See COMP 361D1 for course description.
Terms: Winter 2014
Instructors: Jorg Andreas Kienzle (Winter)
 Prerequisite: COMP 361D1
 No credit will be given for this course unless both COMP 361D1 and COMP 361D2 are successfully completed in consecutive terms

ECSE 427 Operating Systems (3 credits) **
Overview
Electrical Engineering : Operating system services, file system organization, disk and cpu scheduling, virtual memory management, concurrent processing and distributed systems, protection and security. Aspects of the DOS and UNIX operating systems and the C programming language. Programs that communicate between workstations across a network.
Terms: Fall 2013, Winter 2014
Instructors: Xue Liu (Fall) Muthucumaru Maheswaran (Winter)
 (315)
 Prerequisite: ECSE 322 or COMP 273
 Tutorials assigned by instructor.

ECSE 429 Software Validation (3 credits)
Overview
Electrical Engineering : Correct and complete implementation of software requirements. Verification and validation lifecycle. Requirements analysis, model based analysis, and design analysis. Unit and system testing, performance, risk management, software reuse. Ubiquitous computing.
Terms: Fall 2013
Instructors: Gunter Mussbacher (Fall)
 (324)
 Prerequisite: ECSE 321 or COMP 303

MATH 223 Linear Algebra (3 credits)
Overview
Mathematics & Statistics (Sci) : Review of matrix algebra, determinants and systems of linear equations. Vector spaces, linear operators and their matrix representations, orthogonality. Eigenvalues and eigenvectors, diagonalization of Hermitian matrices. Applications.
Terms: Fall 2013, Winter 2014
Instructors: William Cavendish (Fall) William Cavendish (Winter)
 Fall and Winter
 Prerequisite: MATH 133 or equivalent
 Restriction: Not open to students in Mathematics programs nor to students who have taken or are taking MATH 236, MATH 247 or MATH 251. It is open to students in Faculty Programs

MATH 240 Discrete Structures 1 (3 credits)
Overview
Mathematics & Statistics (Sci) : Mathematical foundations of logical thinking and reasoning. Mathematical language and proof techniques. Quantifiers. Induction. Elementary number theory. Modular arithmetic. Recurrence relations and asymptotics. Combinatorial enumeration. Functions and relations. Partially ordered sets and lattices. Introduction to graphs, digraphs and rooted trees.
Terms: Fall 2013
Instructors: Dana Louis AddarioBerry (Fall)
 Fall
 Corequisite: MATH 133.
 Restriction: For students in any Computer Science program. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.
Complementary Courses (24 credits)
At least 9 credits selected from groups A and B, with at least 3 credits selected from each:
Group A:

MATH 222 Calculus 3 (3 credits)
Overview
Mathematics & Statistics (Sci) : Taylor series, Taylor's theorem in one and several variables. Review of vector geometry. Partial differentiation, directional derivative. Extreme of functions of 2 or 3 variables. Parametric curves and arc length. Polar and spherical coordinates. Multiple integrals.
Terms: Fall 2013, Winter 2014, Summer 2014
Instructors: Nathan Grieve, Payman L Kassaei (Fall) Dmitry Jakobson (Winter) Sidney Trudeau (Summer)
 Prerequisite: MATH 141. Familiarity with vector geometry or Corequisite: MATH 133
 Restriction: Not open to students who have taken CEGEP course 201303 or MATH 150, MATH 151 or MATH 227

MATH 323 Probability (3 credits)
Overview
Mathematics & Statistics (Sci) : Sample space, events, conditional probability, independence of events, Bayes' Theorem. Basic combinatorial probability, random variables, discrete and continuous univariate and multivariate distributions. Independence of random variables. Inequalities, weak law of large numbers, central limit theorem.
Terms: Fall 2013, Winter 2014, Summer 2014
Instructors: Masoud AsgharianDastenaei (Fall) William J Anderson (Winter) Djivede Kelome (Summer)
 Prerequisites: MATH 141 or equivalent.
 Restriction: Intended for students in Science, Engineering and related disciplines, who have had differential and integral calculus
 Restriction: Not open to students who have taken or are taking MATH 356

MATH 324 Statistics (3 credits)
Overview
Mathematics & Statistics (Sci) : Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Terms: Fall 2013, Winter 2014
Instructors: William J Anderson (Fall) Masoud AsgharianDastenaei (Winter)
 Fall and Winter
 Prerequisite: MATH 323 or equivalent
 Restriction: Not open to students who have taken or are taking MATH 357
 You may not be able to receive credit for this course and other statistic courses. Be sure to check the Course Overlap section under Faculty Degree Requirements in the Arts or Science section of the Calendar.
Group B:

COMP 330 Theory of Computation (3 credits)
Overview
Computer Science (Sci) : Mathematical models of computers, finite automata, Turing machines, counter machines, pushdown machines, computational complexity.
Terms: Fall 2013
Instructors: Prakash Panangaden (Fall)
 3 hours
 Prerequisite: COMP 251.

COMP 360 Algorithm Design (3 credits)
Overview
Computer Science (Sci) : Advanced algorithm design and analysis. Linear programming, complexity and NPcompleteness, advanced algorithmic techniques.
Terms: Fall 2013, Winter 2014
Instructors: David Avis (Fall) Hamed Hatami (Winter)
 3 hours
 Prerequisite: Either COMP 251 or COMP 252, and either MATH 240 or MATH 235 or MATH 363.
 Restriction: Not open to students who have taken or are taking COMP 362.
At least 15 credits selected from the following, with at least 6 credits selected from Software Engineering Specializations, and at least 6 credits selected from Applications Specialties.
Software Engineering Specializations
* Students may select either COMP 409 or ECSE 420, but not both.

COMP 409 Concurrent Programming (3 credits) *
Overview
Computer Science (Sci) : Characteristics and utility of concurrent programs; formal methods for specification, verification and development of concurrent programs; communications, synchronization, resource allocation and management, coherency and integrity.
Terms: Fall 2013
Instructors: Clark Verbrugge (Fall)
 3 hours
 Prerequisites: COMP 251, COMP 302, and COMP 310 or ECSE 427

COMP 523 Languagebased Security (3 credits)
Overview
Computer Science (Sci) : Stateoftheart languagebased techniques for enforcing security policies in distributed computing environments. Static techniques (such as type and proofchecking technology), verification of security policies and applications such as proofcarrying code, certifying compilers, and proofcarrying authentication.
Terms: This course is not scheduled for the 20132014 academic year.
Instructors: There are no professors associated with this course for the 20132014 academic year.
 3 hours
 Prerequisites: COMP 302, COMP 330.

COMP 525 Formal Verification (3 credits)
Overview
Computer Science (Sci) : Propositional logic  syntax and semantics, temporal logic, other modal logics, model checking, symbolic model checking, binary decision diagrams, other approaches to formal verification.
Terms: This course is not scheduled for the 20132014 academic year.
Instructors: There are no professors associated with this course for the 20132014 academic year.
 3 hours
 Prerequisites: COMP 251 and COMP 330.

COMP 529 Software Architecture (4 credits)
Overview
Computer Science (Sci) : Development, analysis, and maintenance of software architectures, with special focus on modular decomposition and reverse engineering.
Terms: Winter 2014
Instructors: Joseph P Vybihal (Winter)
 4 hours
 Prerequisite: COMP 303 or COMP 304.

COMP 533 ModelDriven Software Development (3 credits)
Overview
Computer Science (Sci) : Modeldriven software development; requirements engineering based on use cases and scenarios; objectoriented modelling using UML and OCL to establish complete and precise analysis and design documents; mapping to Java. Introduction to metamodelling and model transformations, use of modelling tools.
Terms: Fall 2013
Instructors: Jorg Andreas Kienzle (Fall)
 3 hours
 Prerequisite: COMP 335 or ECSE 321 or COMP 303 or COMP 361

ECSE 420 Parallel Computing (3 credits) *
Overview
Electrical Engineering : Modern parallel computing architectures for shared memory, message passing and data parallel programming models. The design of cache coherent shared memory multiprocessors. Programming techniques for multithreaded, message passing and distributed systems. Use of modern programming languages and parallel programming libraries.
Terms: Fall 2013
Instructors: Zeljko Zilic (Fall)
 (324)
 Prerequisite: ECSE 427
Application Specialties
* Students may select either COMP 557 or ECSE 532, but not both.

COMP 350 Numerical Computing (3 credits)
Overview
Computer Science (Sci) : Computer representation of numbers, IEEE Standard for Floating Point Representation, computer arithmetic and rounding errors. Numerical stability. Matrix computations and software systems. Polynomial interpolation. Leastsquares approximation. Iterative methods for solving a nonlinear equation. Discretization methods for integration and differential equations.
Terms: Fall 2013
Instructors: XiaoWen Chang (Fall)
 3 hours
 Prerequisites: MATH 222 and MATH 223 and one of: COMP 202, COMP 208, COMP 250; or equivalents.

COMP 417 Introduction Robotics and Intelligent Systems (3 credits)
Overview
Computer Science (Sci) : This course considers issues relevant to the design of robotic and of intelligent systems. How can robots move and interact. Robotic hardware systems. Kinematics and inverse kinematics. Sensors, sensor data interpretation and sensor fusion. Path planning. Configuration spaces. Position estimation. Intelligent systems. Spatial mapping. Multiagent systems. Applications.
Terms: Fall 2013
Instructors: Ioannis Rekleitis (Fall)
 3 hours
 Prerequisites: COMP 424 and MATH 223.

COMP 421 Database Systems (3 credits)
Overview
Computer Science (Sci) : Database Design: conceptual design of databases (e.g., entityrelationship model), relational data model, functional dependencies. Database Manipulation: relational algebra, SQL, database application programming, triggers, access control. Database Implementation: transactions, concurrency control, recovery, query execution and query optimization.
Terms: Winter 2014
Instructors: Bettina Kemme (Winter)
 3 hours
 Prerequisites: COMP 206, COMP 251, COMP 302

COMP 424 Artificial Intelligence (3 credits)
Overview
Computer Science (Sci) : Introduction to search methods. Knowledge representation using logic and probability. Planning and decision making under uncertainty. Introduction to machine learning.
Terms: Winter 2014
Instructors: Joelle Pineau (Winter)
 3 hours
 Prerequisites: (COMP 206 or ECSE 321) and COMP 251

COMP 512 Distributed Systems (4 credits)
Overview
Computer Science (Sci) : Models and Architectures. Applicationoriented communication paradigms (e.g. remote method invocation, group communication). Naming services. Synchronization (e.g. mutual exclusion, concurrency control). Faulttolerance (e.g. process and replication, agreement protocols). Distributed file systems. Security. Examples of distributed systems (e.g. Web, CORBA). Advanced Topics.
Terms: Fall 2013
Instructors: Bettina Kemme (Fall)
 4 hours
 Prerequisites: COMP 310, COMP 251 or equivalent.

COMP 520 Compiler Design (4 credits)
Overview
Computer Science (Sci) : The structure of a compiler. Lexical analysis. Parsing techniques. Syntax directed translation. Runtime implementation of various programming language constructs. Introduction to code generation for an idealized machine. Students will implement parts of a compiler.
Terms: Fall 2013
Instructors: Matthieu Dubet (Fall)
 3 hours, 1 hour consultation
 Prerequisites: COMP 273 and COMP 302

COMP 521 Modern Computer Games (4 credits)
Overview
Computer Science (Sci) : Genre and history of games, basic game design, storytelling and narrative analysis, game engines, design of virtual worlds, realtime 2D graphics, game physics and physical simulation, pathfinding and game AI, content generation, 3D game concerns, multiplayer and distributed games, social issues.
Terms: Winter 2014
Instructors: Clark Verbrugge (Winter)
 4 hours
 Prerequisite: COMP 303 or COMP 361.
 Corequisite: COMP 557.

COMP 522 Modelling and Simulation (4 credits)
Overview
Computer Science (Sci) : Simulation and modelling processes, state automata, Petri Nets, state charts, discrete event systems, continuoustime models, hybrid models, system dynamics and objectoriented modelling.
Terms: This course is not scheduled for the 20132014 academic year.
Instructors: There are no professors associated with this course for the 20132014 academic year.
 3 hours
 Prerequisites: COMP 251, COMP 302

COMP 535 Computer Networks 1 (3 credits)
Overview
Computer Science (Sci) : Exposition of the first four layers of the ISO model for computer network protocols, i.e., the physical, data, network, and transport layers. Basic hardware and software issues with examples drawn from existing networks, notably SNA, DECnet, and ARPAnet.
Terms: Fall 2013
Instructors: Muthucumaru Maheswaran (Fall)
 3 hours
 Prerequisite: COMP 310
 Restriction: Students may not take both COMP 435 and COMP 535 for credit

COMP 557 Fundamentals of Computer Graphics (3 credits) *
Overview
Computer Science (Sci) : The study of fundamental mathematical, algorithmic and representational issues in computer graphics. The topics to be covered are: overview of graphics process, projective geometry, homogeneous coordinates, projective transformations, quadrics and tensors, linedrawing, surface modelling and object modelling reflectance models and rendering, texture mapping, polyhedral representations, procedural modelling, and animation.
Terms: Fall 2013
Instructors: Paul Kry (Fall)
 3 hours
 Prerequisite: MATH 223, COMP 251, COMP 206

COMP 558 Fundamentals of Computer Vision (3 credits)
Overview
Computer Science (Sci) : Biological vision, edge detection, projective geometry and camera modelling, shape from shading and texture, stereo vision, optical flow, motion analysis, object representation, object recognition, graph theoretic methods, high level vision, applications.
Terms: Fall 2013
Instructors: Kaleem Siddiqi (Fall)
 3 hours
 Prerequisites: COMP 206, COMP 360, MATH 222, MATH 223
 Restriction: not open to students who have taken 308766 before January 2001

ECSE 424 HumanComputer Interaction (3 credits)
Overview
Electrical Engineering : The course highlights humancomputer interaction strategies from an engineering perspective. Topics include user interfaces, novel paradigms in humancomputer interaction, affordances, ecological interface design, ubiquitous computing and computersupported cooperative work. Attention will be paid to issues of safety, usability, and performance.
Terms: Winter 2014
Instructors: Jeremy Cooperstock (Winter)
 (342)
 Prerequisites: ECSE 322 or (COMP 251 and COMP 273)

ECSE 532 Computer Graphics (3 credits) *
Overview
Electrical Engineering : Introduction to computer graphics systems and display devices: raster scan, scan conversion, graphical input and interactive techniques  window environments; display files: graphics languages and data structures: 2D transformations; 3D computer graphics, hidden line removal and shading; graphics system design; applications. Laboratory project involving the preparation and running of graphics programs.
Terms: This course is not scheduled for the 20132014 academic year.
Instructors: There are no professors associated with this course for the 20132014 academic year.
 (306)
 Prerequisite: ECSE 322