Computer Science

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.

Offered by: Computer Science

• 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

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Daniel G Pomerantz, Jorg Andreas Kienzle
  • Daniel G Pomerantz, Bettina Kemme

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.

Offered by: Computer Science

• 3 hours
• Prerequisite: COMP 202 or COMP 250

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Joseph P Vybihal, Wenbo He
  • Joseph P Vybihal

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.

Offered by: Computer Science

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

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Mathieu Blanchette
  • Doina Precup

Computer Science (Sci): Introduction to algorithm design and analysis. Graph algorithms, greedy algorithms, data structures, dynamic programming, maximum flows.

Offered by: Computer Science

• 3 hours
• Prerequisite: COMP 250 or COMP 203.
• Restrictions: Not open to students who have taken or are taking COMP 252.

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Prakash Panangaden
  • Michael Langer

Computer Science (Sci): A history of early mathematical computation. Symbolic logic and computation. Modern computer systems and networks. The rise of the internet.

Offered by: Computer Science

• 3 hours

• Terms
  • This course is not scheduled for the 2013 academic year
• Instructors
  • There are no professors associated with this course for the 2013 academic year.

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.

Offered by: Computer Science

• 3 hours
• Prerequisite: COMP 250 or COMP 203

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Brigitte Pientka
  • Prakash Panangaden

Computer Science (Sci): Mathematical models of computers, finite automata, Turing machines, counter machines, push-down machines, computational complexity.

Offered by: Computer Science

• 3 hours
• Prerequisite: COMP 251.

• Terms
  • Fall 2013
• Instructors
  • Hamed Hatami

Computer Science (Sci): Advanced algorithm design and analysis. Linear programming, complexity and NP-completeness, advanced algorithmic techniques.

Offered by: Computer Science

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

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • David Avis
  • Hamed Hatami

Computer Science (Sci): A computer related project, typically a programming effort, along with a report will be carried out in cooperation with a staff member in the School of Computer Science.

Offered by: Computer Science

• 3 hours
• Prerequisites: 15 Computer Science credits.
• Restriction: For Honours students

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Nathan Friedman
  • Nathan Friedman

Computer Science (Sci): Characteristics and utility of concurrent programs; formal methods for specification, verification and development of concurrent programs; communications, synchronization, resource allocation and management, coherency and integrity.

Offered by: Computer Science

• 3 hours
• Prerequisites: COMP 251, COMP 302, and COMP 310 or ECSE 427

• Terms
  • Fall 2013
• Instructors
  • Clark Verbrugge

Computer Science (Sci): This course considers issues relevant to the design of robotic and of intelligent systems. How can robots move and interact. Robotic hardware systems. Kinematics and inverse kinematics. Sensors, sensor data interpretation and sensor fusion. Path planning. Configuration spaces. Position estimation. Intelligent systems. Spatial mapping. Multi-agent systems. Applications.

Offered by: Computer Science

• 3 hours
• Prerequisites: COMP 424 and MATH 223.

• Terms
  • Fall 2013
• Instructors
  • Ioannis Rekleitis

Computer Science (Sci): Database Design: conceptual design of databases (e.g., entity-relationship model), relational data model, functional dependencies. Database Manipulation: relational algebra, SQL, database application programming, triggers, access control. Database Implementation: transactions, concurrency control, recovery, query execution and query optimization.

Offered by: Computer Science

• 3 hours
• Prerequisites: COMP 206, COMP 251, COMP 302

• Terms
  • Winter 2014
• Instructors
  • Bettina Kemme

Computer Science (Sci): Introduction to search methods. Knowledge representation using logic and probability. Planning and decision making under uncertainty. Introduction to machine learning.

Offered by: Computer Science

• 3 hours
• Prerequisites: (COMP 206 or ECSE 321) and COMP 251

• Terms
  • Winter 2014
• Instructors
  • Joelle Pineau

Computer Science (Sci): Belief networks, Utility theory, Markov Decision Processes and Learning Algorithms.

Offered by: Computer Science

• 3 hours
• Prerequisites: COMP 206, COMP 360, COMP 424 and MATH 323

• Terms
  • This course is not scheduled for the 2013 academic year
• Instructors
  • There are no professors associated with this course for the 2013 academic year.

Computer Science (Sci): Introduction to modern constructive logic, its mathematical properties, and its numerous applications in computer science.

Offered by: Computer Science

• 3 hours
• Prerequisite: COMP 302
• Restriction: Not open to students who have taken COMP 426

• Terms
  • Winter 2014
• Instructors
  • Brigitte Pientka

Computer Science (Sci): Models for sequential and parallel computations: Turing machines, boolean circuits. The equivalence of various models and the Church-Turing thesis. Unsolvable problems. Model dependent measures of computational complexity. Abstract complexity theory. Exponentially and super-exponentially difficult problems. Complete problems.

Offered by: Computer Science

• 3 hours
• Prerequisite: COMP 330

• Terms
  • Winter 2014
• Instructors
  • Denis Therien

Computer Science (Sci): Biological vision, edge detection, projective geometry and camera modelling, shape from shading and texture, stereo vision, optical flow, motion analysis, object representation, object recognition, graph theoretic methods, high level vision, applications.

Offered by: Computer Science

• 3 hours
• Prerequisites: COMP 206, COMP 360, MATH 222, MATH 223
• Restriction: not open to students who have taken 308-766 before January 2001

• Terms
  • Fall 2013
• Instructors
  • Kaleem Siddiqi

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.

Offered by: Mathematics and Statistics

• 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

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Payman L Kassaei, Wilbur Jonsson
  • Wilbur Jonsson

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.

Offered by: Mathematics and Statistics

• 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

• Terms
  • Fall 2013
  • Winter 2014
• Instructors
  • Wilbur Jonsson
  • Wilbur Jonsson

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.

Offered by: Mathematics and Statistics

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

• Terms
  • Fall 2013
• Instructors
  • Dana Louis Addario-Berry