不良研究所

不良研究所.ca / Overview / Faculty of Science / Undergraduate / Programs

Major Computer Science (63 credits)

important

Note: This is the 2018鈥�2019 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 is the standard Major program offered by the School of Computer Science. It provides a broad introduction to the principles of computer science and offers ample opportunity to acquire in-depth knowledge of several sub-disciplines. At the same time, its credit requirements allow students to take an additional minor.

Students may complete this program with a minimum of 60 credits or a maximum of 63 credits depending if they are exempt from taking COMP 202.

Required Courses (33 credits)

* Students who have sufficient knowledge in a programming language do not need to take COMP 202.

  • 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 2018, Winter 2019, Summer 2019

    Instructors: Alberini, Giulia; Vybihal, Joseph P (Fall) Alberini, Giulia; Yu, Tzu-Yang; Zammar, Chad (Winter) Yu, Tzu-Yang (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 2018, Winter 2019

    Instructors: Meger, David (Fall) Vybihal, Joseph P; Zammar, Chad (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 2018, Winter 2019

    Instructors: Langer, Michael; Alberini, Giulia (Fall) Robillard, Martin; 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 2018, Winter 2019

    Instructors: Waldispuhl, J茅r么me (Fall) Devroye, Luc P; McLeish, Erin Leigh (Winter)

    • 3 hours

    • Prerequisite: COMP 250

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

    • 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 and 363, 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 2018, Winter 2019

    Instructors: Kry, Paul (Fall) Siddiqi, Kaleem (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 2018, Winter 2019

    Instructors: Pientka, Brigitte (Fall) Panangaden, Prakash (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 2018, Winter 2019

    Instructors: Nassif, Mathieu; Vybihal, Joseph P (Fall) Guo, Jin (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 2018, Winter 2019

    Instructors: Maheswaran, Muthucumaru (Fall) Vybihal, Joseph P (Winter)

  • 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 2018, Winter 2019, Summer 2019

    Instructors: Macdonald, Jeremy; Faifman, Dmitry (Fall) Sektnan, Lars (Winter) Pequignot, Yann Batiste (Summer)

  • 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 2018, Winter 2019

    Instructors: Kelome, Djivede (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 236, MATH 247 or MATH 251. It is open to students in Faculty Programs

  • MATH 240 Discrete Structures 1 (3 credits)

    Offered by: Mathematics and Statistics (Faculty of Science)

    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 2018, Winter 2019

    Instructors: Macdonald, Jeremy; Nica, Bogdan (Fall) Macdonald, Jeremy; Pequignot, Yann Batiste (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 (30 credits)

Students should talk to an academic adviser before choosing their complementary courses.

At least 6 credits selected from:

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

    Instructors: Panangaden, Prakash (Fall)

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

    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 2018, Winter 2019

    Instructors: Reed, Bruce Alan (Fall) Reed, Bruce Alan (Winter)

3-9 credits selected from:
* Must include at least one of MATH 323 and MATH 340.

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

    Instructors: Sabok, Marcin (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 2018, Winter 2019, Summer 2019

    Instructors: Stephens, David (Fall) Wolfson, David B (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 2018, Winter 2019

    Instructors: Khalili Mahmoudabadi, Abbas (Fall) Asgharian-Dastenaei, 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.

  • MATH 340 Discrete Structures 2 (3 credits) *

    Offered by: Mathematics and Statistics (Faculty of Science)

    Overview

    Mathematics & Statistics (Sci) : Review of mathematical writing, proof techniques, graph theory and counting. Mathematical logic. Graph connectivity, planar graphs and colouring. Probability and graphs. Introductory group theory, isomorphisms and automorphisms of graphs. Enumeration and listing.

    Terms: Winter 2019

    Instructors: Fortier, Jerome (Winter)

At least 6 credits at the 400-level or above.

The remaining credits selected from computer science courses at the 300 level or above (except COMP 364 and COMP 396) and ECSE 539.

Note: Students have to make sure that they have the appropriate prerequisites when choosing upper-level courses.

Faculty of Science—2018-2019 (last updated Aug. 22, 2018) (disclaimer)
Back to top