Note: This is the 2010鈥�2011 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 Introduction to Computing 1 (3 credits) *
Overview
Computer Science (Sci) : Overview of components of microcomputers, the internet design and implementation of programs using a modern high-level language, an introduction to modular software design and debugging. Programming concepts are illustrated using a variety of application areas.
Terms: Fall 2010, Winter 2011, Summer 2011
Instructors: Petitpas, Mathieu; Frydrychowicz, Maja (Fall) Frydrychowicz, Maja; Pomerantz, Daniel (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 203 Introduction to Computing 2 (3 credits) **
Overview
Computer Science (Sci) : Basic data structures. Representation of arrays, stacks, and queues. Linked lists and their applications to binary trees. Internal sorting. Graph representation. Elementary graph algorithms.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- 3 hours
- Prerequisites: MATH 133 and COMP 202
- Restrictions: COMP 203 and COMP 250 are considered to be equivalent from a prerequisite point of view, and cannot both be taken for credit. Students who are registered in the following programs: Major or Honours in Computer Science, Major in Software Engineering, any of the joint major programs offered through the Faculty of Science and the Major Concentration in Foundations of Computing, in the Faculty of Arts, may not take this course.
-
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 2010, Winter 2011
Instructors: Vybihal, Joseph P (Fall) Vybihal, Joseph P; Dudek, Gregory L (Winter)
- 3 hours
- Prerequisite: COMP 202 or COMP 250
-
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 2010, Winter 2011
Instructors: Precup, Doina (Fall) Langer, Michael (Winter)
- 3 hours
- Prerequisites: Familiarity with a high level programming language and CEGEP level Math.
- Restrictions: COMP 203 and COMP 250 are considered to be equivalent from a prerequisite point of view, and cannot both be taken for credit.
-
COMP 251 Data Structures and Algorithms (3 credits)
Overview
Computer Science (Sci) : Design and analysis of algorithms. Complexity of algorithms. Data structures. Introduction to graph algorithms and their analysis.
Terms: Fall 2010, Winter 2011
Instructors: Verbrugge, Clark (Fall) Crepeau, Claude (Winter)
- 3 hours
- Prerequisite: COMP 250 or COMP 203.
- 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 2010, Winter 2011
Instructors: Vybihal, Joseph P (Fall) Siddiqi, Kaleem (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 2010, Winter 2011, Summer 2011
Instructors: Jonsson, Wilbur; Sancho, Neville G F (Fall) Jonsson, Wilbur (Winter)
- Prerequisite: MATH 141. Familiarity with vector geometry or Corequisite: MATH 133
- Restriction: Not open to students who have taken CEGEP course 201-303 or MATH 150, MATH 151 or MATH 227
-
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 2010
Instructors: Shepherd, Frederick (Fall)
- Fall
- Corequisite: MATH 133.
- Restriction: For students in any Computer Science program. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.
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 2010, Winter 2011
Instructors: Loveys, James G; Huang, Hongnian (Fall) Loveys, James G (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 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 2010
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 2010, Winter 2011, Summer 2011
Instructors: Anderson, William J (Fall) Partovi Nia, Vahid (Winter)
- 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)
Overview
Mathematics & Statistics (Sci) : Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Terms: Fall 2010, Winter 2011
Instructors: Asgharian-Dastenaei, Masoud (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 2011
Instructors: Vetta, Adrian Roshan (Winter)
- Winter
- Prerequisites: MATH 235 or MATH 240 or MATH 242.
- Corequisites: MATH 223 or MATH 236.
- Restriction: Not open to students who have taken or are taking MATH 343 or MATH 350.
At least 3 credits from:
-
COMP 330 Theoretical Aspects: Computer Science (3 credits)
Overview
Computer Science (Sci) : Mathematical models of computers, finite automata, Turing machines, counter machines, push-down machines, computational complexity.
Terms: Fall 2010
Instructors: Hatami, Hamed (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 2010
Instructors: Chang, Xiao-Wen (Fall)
- 3 hours
- Prerequisites: MATH 222 and MATH 223 and one of: COMP 202, COMP 208, COMP 250; or equivalents.
-
COMP 360 Algorithm Design Techniques (3 credits)
Overview
Computer Science (Sci) : A study of techniques for the design and analysis of algorithms.
Terms: Fall 2010, Winter 2011
Instructors: Vetta, Adrian Roshan (Fall) Nguyen, The Phuong (Winter)
- 3 hours
- Prerequisite: Either COMP 251 or COMP 252, and either MATH 240 or MATH 235 or MATH 363.
- Restriction: Not open to students who have taken or are taking COMP 362.
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 2010, Winter 2011
Instructors: Pientka, Brigitte (Fall) Doherty, Jesse (Winter)
- 3 hours
- Prerequisite: COMP 250 or COMP 203
-
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 2010
Instructors: Robillard, Martin (Fall)
- Winter
- 3 hours
- Prerequisites: COMP 206, COMP 250.
- Corequisite: COMP 302.
- The course involves a significant project
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 2010
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 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
- (3-0-6)
- Prerequisite: ECSE 305 or equivalent.
Faculty of Arts—2010-2011 (last updated Jan. 19, 2011) (disclaimer)