捆绑SM社区

Program Requirements

The Minor Concentration Computer Science is designed to provide the basics of computer science principles, and it make be taken in conjunction with any program in the Faculty of Arts.

Required Courses (9 credits)

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

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

* Students who have taken the equivalent of COMP 202 prior to their 捆绑SM社区 studies should replace it with an additional Computer Science Complementary course.

Complementary Courses (9-15 credits)

Students are strongly encouraged to talk to an adviser of the School before choosing their complementary courses to ensure they follow an approved course sequence.

6 credits from*:

• MATH 133 Linear Algebra and Geometry (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  Overview

  Mathematics & Statistics (Sci) : Systems of linear equations, matrices, inverses, determinants; geometric vectors in three dimensions, dot product, cross product, lines and planes; introduction to vector spaces, linear dependence and independence, bases. Linear transformations. Eigenvalues and diagonalization.

  Terms: Fall 2024, Winter 2025, Summer 2025

  Instructors: Macdonald, Jeremy; Ayala, Miguel; Branchereau, Romain; Giard, Antoine (Fall) Pinet, Th茅o (Winter)

  • 3 hours lecture, 1 hour tutorial

  • Prerequisite: a course in functions

  • Restriction(s): 1) Not open to students who have taken CEGEP objective 00UQ or equivalent. 2) Not open to students who have taken or are taking MATH 123, except by permission of the Department of Mathematics and Statistics.

• MATH 140 Calculus 1 (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  Overview

  Mathematics & Statistics (Sci) : Review of functions and graphs. Limits, continuity, derivative. Differentiation of elementary functions. Antidifferentiation. Applications.

  Terms: Fall 2024, Winter 2025, Summer 2025

  Instructors: Sabok, Marcin; Trudeau, Sidney; Kalmykov, Artem (Fall) Huang, Peiyuan; Trudeau, Sidney (Winter)

  • 3 hours lecture, 1 hour tutorial

  • Prerequisite: High School Calculus

  • Restriction(s): 1) Not open to students who have taken MATH139 or MATH 150 or CEGEP objective 00UN or equivalent. 2) Not open to students who have taken or are taking MATH 122, except by permission of the Department of Mathematics and Statistics.

  • Each Tutorial section is enrolment limited

*Students who have taken equivalent courses in CEGEP or elsewhere, or have advanced placement will be granted Advanced Standing and do not need to take these courses.

9 credits selected from the following list or from Computer Science (COMP) courses at the 300 level or above excluding COMP 396, COMP 400, COMP 401, COMP 402, COMP 480.

• COMP 230 Logic and Computability (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

  Computer Science (Sci) : Propositional Logic, predicate calculus, proof systems, computability Turing machines, Church-Turing thesis, unsolvable problems, completeness, incompleteness, Tarski semantics, uses and misuses of G枚del's theorem.

  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: CEGEP level mathematics.

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