Note: This is the 2016–2017 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
Program Requirements
This program provides a more challenging and researchoriented 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.
Required Courses (42 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 computer programming in a high level language: variables, expressions, primitive types, methods, conditionals, loops. Introduction to algorithms, data structures (arrays, strings), modular software design, libraries, file input/output, debugging, exception handling. Selected topics.
Terms: Fall 2016, Winter 2017, Summer 2017
Instructors: Kaleem Siddiqi, Melanie LymanAbramovitch, Daniel Pomerantz (Fall) Melanie LymanAbramovitch, Bentley Oakes, Giulia Alberini (Winter) David Becerra Romero (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

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 2016, Winter 2017
Instructors: David Meger (Fall) Joseph P Vybihal (Winter)

COMP 250 Introduction to Computer Science (3 credits)
Overview
Computer Science (Sci) : Mathematical tools (binary numbers, induction, recurrence relations, asymptotic complexity, establishing correctness of programs), Data structures (arrays, stacks, queues, linked lists, trees, binary trees, binary search trees, heaps, hash tables), Recursive and nonrecursive algorithms (searching and sorting, tree and graph traversal). Abstract data types, inheritance. Selected topics.
Terms: Fall 2016, Winter 2017
Instructors: Michael Langer (Fall) Mathieu Blanchette (Winter)

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 2016, Winter 2017
Instructors: Claude Crepeau (Fall) Jérôme Waldispuhl (Winter)

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 2016, Winter 2017
Instructors: Paul Kry (Fall) Joseph P Vybihal (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 2016, Winter 2017
Instructors: Clark Verbrugge (Fall) Prakash Panangaden (Winter)
3 hours
Prerequisite: COMP 250

COMP 303 Software Design (3 credits)
Overview
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for objectoriented software design and its implementation, including encapsulation, design patterns, and unit testing.
Terms: Fall 2016, Winter 2017
Instructors: Joseph P Vybihal (Fall) Martin Robillard (Winter)

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 2016, Winter 2017
Instructors: Muthucumaru Maheswaran (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 2016
Instructors: 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

COMP 361D2 Software Engineering Project (3 credits)
Overview
Computer Science (Sci) : See COMP 361D1 for course description.
Terms: Winter 2017
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

COMP 400 Project in Computer Science (3 credits)
Overview
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 2016, Winter 2017, Summer 2017
Instructors: Nathan Friedman (Fall) Nathan Friedman (Winter) Nathan Friedman (Summer)
3 hours
Prerequisites: 15 Computer Science credits.
Restriction: For Honours students

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 2016, Winter 2017
Instructors: Muthucumaru Maheswaran (Fall) Muthucumaru Maheswaran (Winter)

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 2016
Instructors: Gunter Mussbacher (Fall)

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 2016, Winter 2017
Instructors: Bogdan Lucian Nica (Fall) Michael Pichot (Winter)

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 2016, Winter 2017
Instructors: Frederick Shepherd (Winter)
Complementary Courses (33 credits)
Of the 33 credits, at least 12 credits must be at the 500 level or above. Courses at the 600 level require special permission. Information on the policy and procedures for such permission may be found at:http://www.mcgill.ca/science/student/general/course/600levelcourses.
At least 9 credits selected from groups A and B, with at least 3 credits selected from each:
Group A:
* Students who have successfully completed MATH 150 and MATH 151 are not required to take MATH 222.

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 2016, Winter 2017, Summer 2017
Instructors: Stephen W Drury, Thomas F Fox (Fall) Alexander Garver (Winter) Geoffrey McGregor (Summer)

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 2016, Winter 2017, Summer 2017
Instructors: Masoud AsgharianDastenaei (Fall) Sanchayan Sen (Winter) Djivede Kelome (Summer)

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 2016, Winter 2017
Instructors: MariePier Côté (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)

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 2016, Winter 2017
Instructors: Yang Cai (Fall) Yang Cai (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.
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: Winter 2017
Instructors: Clark Verbrugge (Winter)

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 20162017 academic year.
Instructors: There are no professors associated with this course for the 20162017 academic year.

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: Winter 2017
Instructors: Prakash Panangaden (Winter)

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: Fall 2016
Instructors: Joseph P Vybihal (Fall)
4 hours
Prerequisite: COMP 303.

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 2016
Instructors: Jorg Andreas Kienzle (Fall)

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 2016
Instructors: Zeljko Zilic (Fall)
(324)
Prerequisite: ECSE 427

ECSE 539 Advanced Software Language Engineering (4 credits)
Overview
Electrical Engineering : Practical and theoretical knowledge for developing software languages and models; foundations for modelbased software development; topics include principles of modeldriven engineering; concerndriven development; intentional, structural, and behavioral models as well as configuration models; constraints; language engineering; domainspecific languages; metamodelling; model transformations; models of computation; model analyses; and modeling tools.
Terms: Fall 2016
Instructors: Gunter Mussbacher (Fall)
Application Specialties

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 2016
Instructors: XiaoWen Chang (Fall)

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: Winter 2017
Instructors: Florian Shkurti (Winter)

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 2017
Instructors: Joseph D'silva (Winter)

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 2017
Instructors: Jackie Cheung (Winter)

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: This course is not scheduled for the 20162017 academic year.
Instructors: There are no professors associated with this course for the 20162017 academic year.

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: Winter 2017
Instructors: Alexander Krolik (Winter)

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 2017
Instructors: Clark Verbrugge (Winter)

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 20162017 academic year.
Instructors: There are no professors associated with this course for the 20162017 academic year.

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: Winter 2017
Instructors: Xi Chen (Winter)

COMP 551 Applied Machine Learning (4 credits)
Overview
Computer Science (Sci) : Selected topics in machine learning and data mining, including clustering, neural networks, support vector machines, decision trees. Methods include feature selection and dimensionality reduction, error estimation and empirical validation, algorithm design and parallelization, and handling of large data sets. Emphasis on good methods and practices for deployment of real systems.
Terms: Fall 2016, Winter 2017
Instructors: Joelle Pineau (Fall) Joelle Pineau (Winter)

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 2016
Instructors: Paul Kry (Fall)

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: Winter 2017
Instructors: Kaleem Siddiqi (Winter)

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: Fall 2016
Instructors: Jeremy Cooperstock (Fall)
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.