2010-2011
This program provides a more challenging and research-oriented version of the Major Software Engineering program.
Students may complete this program with a maximum of 75 credits or a minimum of 72 credits if they are exempt from taking COMP 202.
Honours students must maintain a CGPA of at least 3.00 during their studies and at graduation.
* 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.
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) : 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) : 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) : A computer related project, typically a programming effort, along with a report will be carried out in cooperation with a staff member in the School of Computer Science.
Terms: Fall 2010, Winter 2011, Summer 2011
Instructors: Nathan Friedman (Fall) Nathan Friedman (Winter)
Summer
3 hours
Prerequisites: 15 Computer Science credits.
Restriction: For Honours students
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 2010, Winter 2011
Instructors: Carl Tropper (Fall) Andraws Swidan (Winter)
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 2010
Instructors: Katarzyna Radecka (Fall)
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)
Of the 33 credits, at least 12 credits must be at the 500-level or above. Courses at the 600- or 700-level require special permission. Information on the policy and procedures for such permission may be found at the website: http://www.mcgill.ca/science/sousa/bsc/course/graduate/.
At least 9 credits selected from groups A and B, with at least 3 credits selected from each:
* Students who have successfully completed MATH 150 and MATH 151 are not required to take MATH 222.
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) : 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)
Mathematics & Statistics (Sci) : Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Terms: Fall 2010, Winter 2011
Instructors: Masoud Asgharian-Dastenaei (Fall) William J Anderson (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.
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) : 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)
At least 18 credits selected from the following, with at least 6 credits selected from Software Engineering Specializations, and at least 9 credits selected from Applications Specialties.
* Students may select either COMP 409 or ECSE 420 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) : State-of-the-art language-based techniques for enforcing security policies in distributed computing environments. Static techniques (such as type- and proof-checking technology), verification of security policies and applications such as proof-carrying code, certifying compilers, and proof-carrying authentication.
Terms: Fall 2010
Instructors: Brigitte Pientka (Fall)
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 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)
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 2010
Instructors: Zeljko Zilic (Fall)
(3-2-4)
Prerequisite: ECSE 427
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) : 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. Multi-agent systems. Applications.
Terms: Fall 2010
Instructors: Ioannis Rekleitis (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) : 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) : Models and Architectures. Application-oriented communication paradigms (e.g. remote method invocation, group communication). Naming services. Synchronization (e.g. mutual exclusion, concurrency control). Fault-tolerance (e.g. process and replication, agreement protocols). Distributed file systems. Security. Examples of distributed systems (e.g. Web, CORBA). Advanced Topics.
Terms: Fall 2010
Instructors: Bettina Kemme (Fall)
Computer Science (Sci) : The structure of a compiler. Lexical analysis. Parsing techniques. Syntax directed translation. Run-time implementation of various programming language constructs. Introduction to code generation for an idealized machine. Students will implement parts of a compiler.
Terms: Fall 2010
Instructors: Jesse Doherty (Fall)
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) : 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.
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)
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 2010
Instructors: Michael Langer (Fall)
Electrical Engineering : The course highlights human-computer interaction strategies from an engineering perspective. Topics include user interfaces, novel paradigms in human-computer interaction, affordances, ecological interface design, ubiquitous computing and computer-supported cooperative work. Attention will be paid to issues of safety, usability, and performance.
Terms: Winter 2011
Instructors: Jeremy Cooperstock (Winter)
(3-4-2)
Prerequisite: ECSE 322
At least 6 credits selected from any COMP courses at the 500-level or above. These may include courses on the Software Engineering Specializations and Application Specialties lists.