Note: This is the 2011–2012 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
Program Requirements
This Major concentration represents an in-depth introduction to computer science and its sub-areas. Students that are interested in further study in Computer Science can combine the Major Concentration Computer Science with the Supplementary Minor in Computer Science to constitute a program very close to the Major Computer Science offered by the Faculty of Science. For further information, please consult the Program Adviser. Students with two programs in the same department/unit must have a third program in a different department/unit to be eligible to graduate. Please refer to the Faculty of Arts regulations for "Faculty Degree Requirements", "About Program Requirements", and "Departmental Programs" for the Multi-track System options.Required Courses (21 credits)
MATH 133, MATH 140, and MATH 141 (or their equivalents) must be completed prior to taking courses in this program.
Notes for the list below:
* Students who have sufficient knowledge in a programming language do not need to take COMP 202 but can replace it with an additional computer science complementary course.
** Students take either COMP 203 or COMP 250 but not both.
-
COMP 202 Foundations of Programming (3 credits) *
Overview
Computer Science (Sci) : Introduction to programming in a modern high-level language, modular software design and debugging. Programming concepts are illustrated using a variety of application areas.
Terms: Fall 2011, Winter 2012, Summer 2012
Instructors: Pomerantz, Daniel; Kienzle, Jorg Andreas (Fall) Pomerantz, Daniel; Liu, Xue (Winter) Pomerantz, Daniel (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 2011, Winter 2012
Instructors: Vybihal, Joseph P (Fall) Vybihal, Joseph P; Dudek, Gregory L; He, Wenbo (Winter)
-
COMP 250 Introduction to Computer Science (3 credits) **
Overview
Computer Science (Sci) : An introduction to the design of computer algorithms, including basic data structures, analysis of algorithms, and establishing correctness of programs. Overview of topics in computer science.
Terms: Fall 2011, Winter 2012
Instructors: Precup, Doina (Fall) Blanchette, Mathieu (Winter)
-
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 2011, Winter 2012
Instructors: Sigler, Andrea Jordana (Fall) Avis, 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 2011, Winter 2012
Instructors: Kry, Paul (Fall) Langer, Michael (Winter)
3 hours
Corequisite: COMP 206.
-
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 2011, Winter 2012, Summer 2012
Instructors: Loveys, James G; Rogers, Mathew (Fall) Loveys, James G (Winter) Fraiman, Nicolás (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 2011
Instructors: Norin, Sergey (Fall)
Complementary Courses (15 credits)
15 credits selected as follows:
3-6 credits from:
-
MATH 223 Linear Algebra (3 credits)
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 2011, Winter 2012
Instructors: Jonsson, Wilbur (Fall) Jonsson, Wilbur (Winter)
-
MATH 318 Mathematical Logic (3 credits)
Overview
Mathematics & Statistics (Sci) : Propositional calculus, truth-tables, switching circuits, natural deduction, first order predicate calculus, axiomatic theories, set theory.
Terms: Fall 2011
Instructors: Loveys, James G (Fall)
Fall
Restriction: Not open to students who are taking or have taken PHIL 210
-
MATH 323 Probability (3 credits)
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 2011, Winter 2012, Summer 2012
Instructors: Anderson, William J (Fall) Wolfson, David B (Winter) Kelome, Djivede (Summer)
-
MATH 324 Statistics (3 credits)
Overview
Mathematics & Statistics (Sci) : Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Terms: Fall 2011, Winter 2012
Instructors: Steele, Russell (Fall) Anderson, William J (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)
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 2012
Instructors: Vetta, Adrian Roshan (Winter)
At least 3 credits from:
-
COMP 330 Theory of Computation (3 credits)
Overview
Computer Science (Sci) : Mathematical models of computers, finite automata, Turing machines, counter machines, push-down machines, computational complexity.
Terms: Fall 2011
Instructors: Panangaden, Prakash (Fall)
3 hours
Prerequisite: COMP 251.
-
COMP 350 Numerical Computing (3 credits)
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 2011
Instructors: Chang, Xiao-Wen (Fall)
-
COMP 360 Algorithm Design (3 credits)
Overview
Computer Science (Sci) : Advanced algorithm design and analysis. Linear programming, complexity and NP-completeness, advanced algorithmic techniques.
Terms: Fall 2011, Winter 2012
Instructors: Hatami, Hamed (Fall) Vetta, Adrian Roshan (Winter)
At least 3 credits from:
-
COMP 302 Programming Languages and Paradigms (3 credits)
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 2011, Winter 2012
Instructors: Boespflug, Mathieu (Fall) Pientka, Brigitte (Winter)
-
COMP 303 Software Development (3 credits)
Overview
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for object-oriented software development: encapsulation, design patterns, unit testing, etc.
Terms: Fall 2011
Instructors: Verbrugge, Clark (Fall)
The remaining credits are selected from Computer Science (COMP) courses at the 300 level or above excluding COMP 364, COMP 396, COMP 400, and COMP 431. The following courses may also be taken:
-
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 2011
Instructors: Schlimm, Dirk (Fall)
3 hours
Prerequisite: CEGEP level mathematics.
-
ECSE 508 Multi-Agent Systems (3 credits)
Overview
Electrical Engineering : Introduction to game theory, strategic games, extensive form games with perfect and imperfect information, repeated games and folk theorems, cooperative game theory, introduction to mechanism design, markets and market equilibrium, pricing and resource allocation, application in telecommunication networks, applications in communication networks, stochastic games.
Terms: This course is not scheduled for the 2011-2012 academic year.
Instructors: There are no professors associated with this course for the 2011-2012 academic year.
- (3-0-6)
- Prerequisite: ECSE 305 or equivalent.
Faculty of Arts—2011-2012 (last updated Jan. 26, 2012) (disclaimer)