![important](/study/2022-2023/files/study.2022-2023/exclamation-point-small.png)
Note: This is the 2022–2023 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .
Note: This is the 2022–2023 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .
Students may complete this program with a minimum of 72 credits or a maximum of 75 credits depending 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 take either MATH 340 or MATH 350.
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 2022, Winter 2023, Summer 2023
Instructors: Campbell, Jonathan (Fall) M'hiri, Faten (Winter) M'hiri, Faten (Summer)
3 hours
Prerequisite: a CEGEP level mathematics course
Restrictions: Not open to students who have taken or are taking COMP 204, COMP 208, or GEOG 333; not open to students who have taken or are taking COMP 206 or COMP 250.
COMP 202 is intended as a general introductory course, while COMP 204 is intended for students in life sciences, and COMP 208 is intended for students in physical sciences and engineering.
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 2022, Winter 2023
Instructors: D'silva, Joseph (Fall) Errington, Jacob; Vybihal, Joseph P (Winter)
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 non-recursive algorithms (searching and sorting, tree and graph traversal). Abstract data types, inheritance. Selected topics.
Terms: Fall 2022, Winter 2023
Instructors: Alberini, Giulia (Fall) Alberini, Giulia (Winter)
Computer Science (Sci) : The design and analysis of data structures and algorithms. The description of various computational problems and the algorithms that can be used to solve them, along with their associated data structures. Proving the correctness of algorithms and determining their computational complexity.
Terms: Winter 2023
Instructors: Devroye, Luc P (Winter)
3 hours
Restrictions: (1) Open only to students in Honours programs. (2) Students cannot receive credit for both COMP 251 and COMP 252.
COMP 252 uses basic combinatorial counting methods that are covered in MATH 240 but not in MATH 235. Students who are unfamiliar with these methods should speak with the instructor for guidance.
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 2022, Winter 2023
Instructors: Vybihal, Joseph P (Fall) Kry, Paul; Elsaadawy, Mona (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 2022, Winter 2023
Instructors: Errington, Jacob (Fall) Errington, Jacob (Winter)
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for object-oriented software design and its implementation, including encapsulation, design patterns, and unit testing.
Terms: Fall 2022, Winter 2023
Instructors: Robillard, Martin (Fall) Guo, Jin (Winter)
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 2022, Winter 2023
Instructors: Maheswaran, Muthucumaru (Fall) Balmau, Oana (Winter)
3 hours
Prerequisite: COMP 273
Computer Science (Sci) : Finite automata, regular languages, context-free languages, push-down automata, models of computation, computability theory, undecidability, reduction techniques.
Terms: Fall 2022, Winter 2023
Instructors: Panangaden, Prakash (Fall) Crépeau, Claude (Winter)
3 hours
Prerequisite: COMP 251.
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 2022
Instructors: Chang, Xiao-Wen (Fall)
Computer Science (Sci) : Basic algorithmic techniques, their applications and limitations. Problem complexity, how to deal with problems for which no efficient solutions are known.
Terms: Winter 2023
Instructors: Vetta, Adrian Roshan (Winter)
Computer Science (Sci) : A research project in any area of computer science, involving a programming effort and/or a theoretical investigation, and supervised by a faculty member in the School of Computer Science. Final written report required.
Terms: Fall 2022, Winter 2023, Summer 2023
Instructors: M'hiri, Faten (Fall) Errington, Jacob (Winter) Errington, Jacob (Summer)
3 hours
Prerequisites: 15 Computer Science credits.
Restriction: For Honours students, or non-Honours students with permission of the department.
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 2022, Winter 2023, Summer 2023
Instructors: Paquette, Elliot; Wrobel, Konrad (Fall) Trudeau, Sidney (Winter) Barill, Gavin (Summer)
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 2022, Winter 2023
Instructors: Macdonald, Jeremy; Pichot, Mikael (Fall) Macdonald, Jeremy (Winter)
Mathematics & Statistics (Sci) : Introduction to discrete mathematics and applications. Logical reasoning and methods of proof. Elementary number theory and cryptography: prime numbers, modular equations, RSA encryption. Combinatorics: basic enumeration, combinatorial methods, recurrence equations. Graph theory: trees, cycles, planar graphs.
Terms: Fall 2022, Winter 2023
Instructors: Vetta, Adrian Roshan; Fortier, Jérôme (Fall) Fortier, Jérôme; Macdonald, Jeremy (Winter)
Mathematics & Statistics (Sci) : Discrete Mathematics and applications. Graph Theory: matchings, planarity, and colouring. Discrete probability. Combinatorics: enumeration, combinatorial techniques and proofs.
Terms: Winter 2023
Instructors: Norin, Sergey (Winter)
Mathematics & Statistics (Sci) : Discrete mathematics. Graph Theory: matching theory, connectivity, planarity, and colouring; graph minors and extremal graph theory. Combinatorics: combinatorial methods, enumerative and algebraic combinatorics, discrete probability.
Terms: Fall 2022
Instructors: Norin, Sergey (Fall)
6 credits selected from:
Mathematics & Statistics (Sci) : Propositional logic: truth-tables, formal proof systems, completeness and compactness theorems, Boolean algebras; first-order logic: formal proofs, Gödel's completeness theorem; axiomatic theories; set theory; Cantor's theorem, axiom of choice and Zorn's lemma, Peano arithmetic; Gödel's incompleteness theorem.
Terms: Fall 2022
Instructors: Sabok, Marcin (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 2022, Winter 2023, Summer 2023
Instructors: Nadarajah, Tharshanna; Sajjad, Alia (Fall) Asgharian, Masoud; Sajjad, Alia (Winter) Kelome, Djivede (Summer)
Mathematics & Statistics (Sci) : Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Terms: Fall 2022, Winter 2023
Instructors: Nadarajah, Tharshanna (Fall) Nadarajah, Tharshanna (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.
The remaining credits selected from computer science courses at the 300 level or above (except COMP 364 and COMP 396) and ECSE 539. At least 12 credits must be at the 500 level.