Note: This is the 2017鈥�2018 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .
Program Requirements
The Minor Concentration Computer Science is designed for students who want to gain a basic understanding of computer science principles and may be taken in conjunction with any program in the Faculty of Arts.
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.
MATH 133, MATH 140, and MATH 141 (or their equivalents) should be completed prior to taking courses in this program.
Required Courses (9 credits)
Notes for the list below:
* Students who have sufficient knowledge in a programming language do not need to take COMP 202 and should replace it 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 2017, Winter 2018, Summer 2018
Instructors: Becerra Romero, David; Alberini, Giulia (Fall) Oakes, Bentley; Alberini, Giulia (Winter) Alberini, Giulia (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)
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 2017, Winter 2018
Instructors: Vybihal, Joseph P (Fall) Meger, David (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), 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 2017, Winter 2018
Instructors: Langer, Michael (Fall) Gonzalez Oliver, Carlos; Waldispuhl, J茅r么me (Winter)
Complementary Courses (9 credits)
9 credits selected from the following list or from Computer Science (COMP) courses at the 300 level or above excluding COMP 364 and COMP 396.
-
COMP 230 Logic and Computability (3 credits)
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: Fall 2017
Instructors: Schlimm, Dirk (Fall)
3 hours
Prerequisite: CEGEP level mathematics.
-
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 2017, Winter 2018
Instructors: Hatami, Hamed (Fall) Vetta, Adrian Roshan (Winter)
3 hours
Prerequisite: COMP 250
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)
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 2017, Winter 2018
Instructors: Siddiqi, Kaleem (Fall) Vybihal, Joseph P (Winter)
3 hours
Corequisite: COMP 206.
-
COMP 280 History and Philosophy of Computing (3 credits)
Overview
Computer Science (Sci) : A history of early mathematical computation. Symbolic logic and computation. Modern computer systems and networks. The rise of the internet.
Terms: This course is not scheduled for the 2017-2018 academic year.
Instructors: There are no professors associated with this course for the 2017-2018 academic year.
3 hours
-
MATH 222 Calculus 3 (3 credits)
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 2017, Winter 2018, Summer 2018
Instructors: Drury, Stephen W; Laaksonen, Niko (Fall) Drury, Stephen W (Winter) Al Balushi, Ibrahim (Summer)
-
MATH 240 Discrete Structures 1 (3 credits)
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 2017, Winter 2018
Instructors: Decorte, Philip Evan (Fall) Seamone, Benjamin (Winter)
Bachelor of Arts & Science—2017-2018 (last updated Oct. 12, 2017) (disclaimer)
