2010-2011
Note: This is the 2010–2011 edition of the eCalendar. For the most recent publication, click here.
This program is a specialization within Computer Science. It fulfils all the basic requirements of the Major Computer Science. Complementary courses focus on topics that are important to understanding the technology behind computer games and to gaining experience in software development and design needed for computer game development.
Students may complete this program with a minimum of 62 credits or a maximum of 67 credits depending if they are exempt from taking COMP 202 and their choice of complementary courses.
* Students who have sufficient knowledge in a programming language do not need to take COMP 202 and can replace it with additional computer science complementary course credits.
Computer Science (Sci) : Overview of components of microcomputers, the internet design and implementation of programs using a modern high-level language, an introduction to modular software design and debugging. Programming concepts are illustrated using a variety of application areas.
Terms: Fall 2010, Winter 2011, Summer 2011
Instructors: Mathieu Petitpas, Maja Frydrychowicz (Fall) Maja Frydrychowicz, Daniel Pomerantz (Winter) Daniel Pomerantz (Summer)
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
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 2010, Winter 2011
Instructors: Joseph P Vybihal (Fall) Joseph P Vybihal, Gregory L Dudek (Winter)
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 2010, Winter 2011
Instructors: Doina Precup (Fall) Michael Langer (Winter)
Computer Science (Sci) : Design and analysis of algorithms. Complexity of algorithms. Data structures. Introduction to graph algorithms and their analysis.
Terms: Fall 2010, Winter 2011
Instructors: Clark Verbrugge (Fall) Claude Crepeau (Winter)
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 2010, Winter 2011
Instructors: Joseph P Vybihal (Fall) Kaleem Siddiqi (Winter)
3 hours
Corequisite: COMP 206.
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 2010, Winter 2011
Instructors: Brigitte Pientka (Fall) Jesse Doherty (Winter)
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for object-oriented software development: encapsulation, design patterns, unit testing, etc.
Terms: Fall 2010
Instructors: Martin Robillard (Fall)
Computer Science (Sci) : Digital circuitry and programming interface of peripheral circuit boards (cards), e.g., graphics cards; introduction to tools and libraries that interact with the card; performance issues.
Terms: Winter 2011
Instructors: Joseph P Vybihal (Winter)
1 hour
Prerequisite: COMP 273.
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 2010, Winter 2011
Instructors: Carl Tropper (Fall) Andraws Swidan (Winter)
3 hours
Prerequisite: COMP 273
Computer Science (Sci) : Basics and advanced features of the C++ language. Syntax, memory management, class structure, method and operator overloading, multiple inheritance, access control, stream I/O, templates, exception handling.
Terms: Winter 2011
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
Computer Science (Sci) : Mathematical models of computers, finite automata, Turing machines, counter machines, push-down machines, computational complexity.
Terms: Fall 2010
Instructors: Hamed Hatami (Fall)
3 hours
Prerequisite: COMP 251.
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 2010
Instructors: Joseph P Vybihal, Jorg Andreas Kienzle (Fall)
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
Computer Science (Sci) : See COMP 361D1 for course description.
Terms: Winter 2011
Instructors: Jorg Andreas Kienzle, Joseph P Vybihal (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
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, line-drawing, surface modelling and object modelling reflectance models and rendering, texture mapping, polyhedral representations, procedural modelling, and animation.
Terms: Fall 2010
Instructors: Paul Kry (Fall)
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 2010, Winter 2011, Summer 2011
Instructors: Wilbur Jonsson, Neville G F Sancho (Fall) Wilbur Jonsson (Winter)
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 2010, Winter 2011
Instructors: James G Loveys, Hongnian Huang (Fall) James G Loveys (Winter)
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 2010
Instructors: Frederick Shepherd (Fall)
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 2010, Winter 2011, Summer 2011
Instructors: William J Anderson (Fall) Vahid Partovi Nia (Winter)
Students complete a minimum of 15 or a maximum of 17 complementary credits selected as follows:
3 credits selected from:
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. Least-squares approximation. Iterative methods for solving a nonlinear equation. Discretization methods for integration and differential equations.
Terms: Fall 2010
Instructors: Xiao-Wen Chang (Fall)
Computer Science (Sci) : A study of techniques for the design and analysis of algorithms.
Terms: Fall 2010, Winter 2011
Instructors: Adrian Roshan Vetta (Fall) The Phuong Nguyen (Winter)
6-8 credits selected from:
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 2011
Instructors: Joelle Pineau (Winter)
Computer Science (Sci) : Problems in computational geometry; worst-case complexity of geometric algorithms; expected complexity of geometric algorithms and geometric probability; geometric intersection problems; nearest neighbour searching; point inclusion problems; distance between sets; diameter and convex hull of a set; polygon decomposition; the Voronoi diagram and other planar graphs; updating and deleting from geometric structures.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
Computer Science (Sci) : Genre and history of games, basic game design, storytelling and narrative analysis, game engines, design of virtual worlds, real-time 2D graphics, game physics and physical simulation, pathfinding and game AI, content generation, 3D game concerns, multiplayer and distributed games, social issues.
Terms: Winter 2011
Instructors: Clark Verbrugge (Winter)
Computer Science (Sci) : Simulation and modelling processes, state automata, Petri Nets, state charts, discrete event systems, continuous-time models, hybrid models, system dynamics and object-oriented modelling.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
Computer Science (Sci) : Object-oriented, UML-based software development; requirements engineering based on use cases; using OCL and a coherent subset of UML to establish complete and precise analysis and design documents for a software system; Java-specific mapping strategies for implementation.
Terms: Fall 2010
Instructors: Jorg Andreas Kienzle (Fall)
6 credits selected from:
* Students take either COMP 435 or COMP 535, but not both.
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 2010
Instructors: Clark Verbrugge (Fall)
Computer Science (Sci) : Database Design: conceptual design of databases (e.g., entity-relationship 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 2011
Instructors: Bettina Kemme (Winter)
Computer Science (Sci) : Exposition of the first four layers of the ISO model for computer network protocols. Socket programming. Network administration and configuration and security issues.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
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: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.