Program Requirements
Students must obtain approval from their main program adviser, and are also strongly encouraged to speak with a School of Computer Science adviser before choosing complementary courses. A particular course selection must be approved before the student registers for their final term of studies.
Students should note that COMP 251 is a prerequisite for many upper level COMP courses. Upper level COMP courses may have prerequisites that are not part of the Minor such as MATH 222, MATH 223, or MATH 323. Students will not get credit for these courses toward the Minor.
Students may receive up to 6 credits toward the Minor by taking certain approved courses outside the School of Computer Science. These courses must have a high computer science content and must be approved by the School of Computer Science in advance. If a student's Major program requires Computer Science courses, up to 6 credits of Computer Science courses may be used to fulfill both Major and Minor requirements.
Required Courses (9 credits)
* Students who have sufficient knowledge of computer programming 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) *
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
Prerequisite: a CEGEP level mathematics course
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.

COMP 206 Introduction to Software Systems (3 credits)
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)
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 nonrecursivealgorithms (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)
Complementary Courses (15 credits)
15 credits selected from the courses below and computer science courses at the 300 level or above (except COMP 364 and COMP 396).

COMP 251 Algorithms and Data Structures (3 credits)
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)

COMP 273 Introduction to Computer Systems (3 credits)
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)
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)