91社区

Program Requirements

This program provides an introduction to the principles of computer science and offers opportunity to get insight into some of its sub-areas. Having only 45 credits, it allows students to combine it with minor or major concentrations in other disciplines.

Required Courses (18 credits)

* Students who have sufficient knowledge in a programming language do not need to take COMP 202, but it must be replaced with an additional computer science complementary course.

• COMP 202 Foundations of Programming (3 credits) *

  Offered by: Computer Science (Faculty of Science)

  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 2024, Winter 2025

  Instructors: M'hiri, Faten (Fall) M'hiri, Faten (Winter)

  • 3 hours

  • 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.

  • To take COMP 202, students should have a solid understanding of pre-calculus fundamentals such as polynomial, trigonometric, exponential, and logarithmic functions.

• COMP 206 Introduction to Software Systems (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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 2024, Winter 2025

  Instructors: Errington, Jacob (Fall) Vybihal, Joseph P; Kopinsky, Max (Winter)

  • 3 hours

  • Prerequisite: COMP 202 or COMP 250

• COMP 250 Introduction to Computer Science (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

  Computer Science (Sci) : Mathematical tools (binary numbers, induction,recurrence relations, asymptotic complexity,establishing correctness of programs). Datastructures (arrays, stacks, queues, linked lists,trees, binary trees, binary search trees, heaps,hash tables). Recursive and non-recursivealgorithms (searching and sorting, tree andgraph traversal). Abstract data types. Objectoriented programming in Java (classes andobjects, interfaces, inheritance). Selected topics.

  Terms: Fall 2024, Winter 2025

  Instructors: Alberini, Giulia (Fall) Alberini, Giulia (Winter)

  • 3 hours

  • Prerequisite(s): MATH 140 or equivalent. COMP 202 or COMP 204 or COMP 208 (or equivalent).

  • Corequisite(s): MATH 133

  • Restriction(s): Not open to students who have taken or are taking ECSE 250.

• COMP 251 Algorithms and Data Structures (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

  Computer Science (Sci) : Introduction to algorithm design and analysis. Graph algorithms, greedy algorithms, data structures, dynamic programming, maximum flows.

  Terms: Fall 2024, Winter 2025

  Instructors: Alberini, Giulia; Henderson, William (Fall) Becerra, David (Winter)

  • 3 hours

  • Prerequisites: COMP 250; MATH 235 or MATH 240

  • COMP 251 uses basic counting techniques (permutations and combinations) that are covered in MATH 240 but not in MATH 235. These techniques will be reviewed for the benefit of MATH 235 students.

  • Restrictions: Not open to students who have taken or are taking COMP 252.

• COMP 273 Introduction to Computer Systems (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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 2024, Winter 2025

  Instructors: Elsaadawy, Mona (Fall) Kry, Paul (Winter)

  • 3 hours

  • Corequisite: COMP 206.

• MATH 240 Discrete Structures (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  Overview

  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 2024, Winter 2025

  Instructors: Macdonald, Jeremy; Goh, Marcel (Fall) Fortier, J茅r么me (Winter)

  • Fall and Winter

  • Corequisite: MATH 133.

  • Restriction: For students in any Computer Science, Computer Engineering, or Software Engineering programs. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.

Complementary Courses (27 credits)

3 credits from each of the groups A, B, C, and D.

Group A

• MATH 222 Calculus 3 (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  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 2024, Winter 2025

  Instructors: Pym, Brent; Tageddine, Damien (Fall) Mazakian, Hovsep (Winter)

  • Prerequisite: MATH 141. Familiarity with vector geometry or Corequisite: MATH 133

  • Restriction: Not open to students who have taken MATH 150, MATH 151 or MATH 262.

• MATH 323 Probability (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  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 2024, Winter 2025

  Instructors: Sajjad, Alia (Fall) Nadarajah, Tharshanna (Winter)

  • 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)

  Offered by: Mathematics and Statistics (Faculty of Science)

  Overview

  Mathematics & Statistics (Sci) : Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.

  Terms: Fall 2024, Winter 2025

  Instructors: Nadarajah, Tharshanna (Fall) Asgharian, Masoud (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

• MATH 223 Linear Algebra (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  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 2024, Winter 2025

  Instructors: Elaidi, Shereen; Bellemare, Hugues (Fall) Macdonald, Jeremy (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 206, MATH 236, MATH 247, or MATH 251.

• MATH 318 Mathematical Logic (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  Overview

  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 2024

  Instructors: Fortier, J茅r么me (Fall)

  • Fall

  • Prerequisite(s): MATH 235 or MATH 240 or MATH 242.

• MATH 340 Discrete Mathematics (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  Overview

  Mathematics & Statistics (Sci) : Discrete Mathematics and applications. Graph Theory: matchings, planarity, and colouring. Discrete probability. Combinatorics: enumeration, combinatorial techniques and proofs.

  Terms: Winter 2025

  Instructors: Norin, Sergey (Winter)

  • Winter

  • Prerequisites: MATH 235 or MATH 240 or MATH 242.

  • Corequisites: MATH 223 or MATH 236.

  • Restriction: Restriction: Not open to students who have taken or are taking MATH 350.

Group C

• COMP 330 Theory of Computation (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

  Computer Science (Sci) : Finite automata, regular languages, context-free languages, push-down automata, models of computation, computability theory, undecidability, reduction techniques.

  Terms: Fall 2024, Winter 2025

  Instructors: Waldispuhl, J茅r么me (Fall) B茅rub茅-Valli猫res, Mathieu (Winter)

  • 3 hours

  • Prerequisite: COMP 251.

• COMP 350 Numerical Computing (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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. Least-squares approximation. Iterative methods for solving a nonlinear equation. Discretization methods for integration and differential equations.

  Terms: Fall 2024

  Instructors: Chang, Xiao-Wen (Fall)

  • 3 hours

  • Prerequisites: MATH 222 and MATH 223 and one of: COMP 202, COMP 208, COMP 250; or equivalents.

  • Restrictions: Students cannot receive credit for both COMP 350 and MATH 317.

• COMP 360 Algorithm Design (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

  Computer Science (Sci) : Advanced algorithm design and analysis. Linear programming, complexity and NP-completeness, advanced algorithmic techniques.

  Terms: Fall 2024, Winter 2025

  Instructors: Robere, Robert (Fall) Hatami, Hamed (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.

Group D

• COMP 302 Programming Languages and Paradigms (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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 2024, Winter 2025

  Instructors: Pientka, Brigitte (Fall) Errington, Jacob (Winter)

  • 3 hours

  • Prerequisite(s): COMP 250 and (MATH 240 or MATH 235 or MATH 318 or COMP 230 or PHIL 210)

• COMP 303 Software Design (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

  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 2024, Winter 2025

  Instructors: Robillard, Martin (Fall) Campbell, Jonathan (Winter)

  • 3 hours

  • Prerequisites: COMP 206, COMP 250.

An additional 3 credits may be selected from Group A or B.

The remaining complementary credits must be selected from any COMP courses at the 300 level or above except COMP 364 and COMP 396.