成人VR视频

Honours Computer Science (75 credits)

Offered by: Computer Science     Degree: Bachelor of Science

Program Requirements

This program provides a more advanced version of the Major Computer Science program. It focuses on more advanced and theory-based algorithms and computer science content, and it includes a required project.

Students may complete this program with a minimum of 72 or a maximum of 75 credits.

Honours students must have a CGPA of at least 3.00 at graduation.

Required Courses (46-49 credits)

* Students who have sufficient knowledge in a programming language do not need to take COMP 202.
** Students take either MATH 340 or MATH 350.

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

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

  • COMP 252 Honours Algorithms and Data Structures (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    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 2025

    Instructors: Devroye, Luc P (Winter)

    • 3 hours

    • Prerequisite: COMP 250 and either MATH 235 or MATH 240

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

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

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

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

  • COMP 310 Operating Systems (3 credits)

    Offered by: Computer Science (Faculty of Science)

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

    Instructors: Kopinsky, Max (Fall) Kopinsky, Max (Winter)

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

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

  • COMP 362 Honours Algorithm Design (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    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: This course is not scheduled for the 2024-2025 academic year.

    Instructors: There are no professors associated with this course for the 2024-2025 academic year.

    • 3 hours

    • Prerequisite: COMP 252

    • Restriction: Not open to students who have taken or are taking COMP 360.

    • Note: COMP 362 can be used instead of COMP 360 to satisfy prerequisites.

  • COMP 400 Project in Computer Science (4 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

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

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

    • 3 hours

    • Prerequisites: 15 Computer Science credits. Department approval and project form required to register.

    • Restriction: Open to Honours students, or non-Honours students with permission of the department.

  • 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, Summer 2025

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

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

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

  • MATH 350 Honours Discrete Mathematics (3 credits) **

    Offered by: Mathematics and Statistics (Faculty of Science)

    Overview

    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 2024

    Instructors: Norin, Sergey (Fall)

    • Prerequisites: MATH 235 or MATH 240 and MATH 251 or MATH 223.

    • Restrictions: Not open to students who have taken or are taking MATH 340. Intended for students in mathematics or computer science honours programs.

    • Intended for students in mathematics or computer science honours programs.

Complementary Courses (26 credits)

6 credits selected from:

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

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

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

Faculty of Science—2024-2025 (last updated Aug. 21, 2024) (disclaimer)
Back to top