³ÉÈËVRÊÓƵ

Dernières mises à jour en lien avec la COVID-19 disponibles ici.
Latest information about COVID-19 available here.

Liberal Program - Core Science Component Computer Science (45 credits)

Note: This is the 2020–2021 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .

Offered by: Computer Science     Degree: Bachelor of Science

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 2020, Winter 2021, Summer 2021

    Instructors: Alberini, Giulia; Campbell, Jonathan (Fall) Alberini, Giulia; Campbell, Jonathan (Winter) Parekh, Deven (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)

    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 2020, Winter 2021

    Instructors: D'silva, Joseph (Fall) D'silva, Joseph; Vybihal, Joseph P (Winter)

  • 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), 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 2020, Winter 2021

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

    • 3 hours

    • Prerequisites: Familiarity with a high level programming language and CEGEP level Math.

    • Students with limited programming experience should take COMP 202 or equivalent before COMP 250. See COMP 202 Course Description for a list of topics.

  • 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 2020, Winter 2021

    Instructors: Waldispuhl, Jérôme; Becerra, David (Fall) Becerra, David (Winter)

    • 3 hours

    • Prerequisite: COMP 250

    • Corequisite(s): MATH 235 or MATH 240.

    • COMP 251 uses mathematical proof techniques that are taught in the corequisite course(s). If possible, students should take the corequisite course prior to COMP 251.

    • 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 2020, Winter 2021

    Instructors: Siddiqi, Kaleem (Fall) Lin, Hsiu-Chin; Kry, Paul (Winter)

  • 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 2020, Winter 2021

    Instructors: Addario-Berry, Louigi Dana; Paquette, Elliot (Fall) Vetta, Adrian Roshan; 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 2020, Winter 2021, Summer 2021

    Instructors: Fortier, Jérôme; Kelome, Djivede (Fall) Vetois, Jerome (Winter) Trudeau, Sidney (Summer)

  • 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 2020, Winter 2021, Summer 2021

    Instructors: Sajjad, Alia; Wolfson, David B (Fall) Wolfson, David B; Sajjad, Alia (Winter) Kelome, Djivede (Summer)

    • 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 2020, Winter 2021

    Instructors: Asgharian, Masoud (Fall) Yang, Yi (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 2020, Winter 2021

    Instructors: Pichot, Michael (Fall) Abdenbi, Brahim (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 236, MATH 247 or MATH 251. It is open to students in Faculty Programs

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

    Instructors: Tserunyan, Anush (Fall)

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

    Instructors: Fortier, Jérôme (Winter)

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 2020, Winter 2021

    Instructors: Hatami, Hamed (Fall) Panangaden, Prakash (Winter)

  • 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 2020, Winter 2021

    Instructors: Chang, Xiao-Wen (Fall)

  • 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 2020, Winter 2021

    Instructors: Hatami, Hamed; Kemme, Bettina; Hosseini, Seyyed Aliasghar (Fall) Hosseini, Seyyed Aliasghar (Winter)

Group D

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.

Faculty of Science—2020-2021 (last updated Mar. 27, 2020) (disclaimer)
Back to top