ƽÌØÎå²»ÖÐ

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) *

  Offered by: Computer Science (Faculty of Science)

  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 2013, Winter 2014, Summer 2014

  Instructors: Pomerantz, Daniel; Tremblay, Jonathan (Fall) Tremblay, Jonathan; Kemme, Bettina; Ada, Anil (Winter) Ada, Anil (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)

  Offered by: Computer Science (Faculty of Science)

  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 2013, Winter 2014

  Instructors: Vybihal, Joseph P (Fall) Vybihal, Joseph P (Winter)

  • 3 hours

  • Prerequisite: COMP 202 or COMP 250

• COMP 250 Introduction to Computer Science (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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 2013, Winter 2014

  Instructors: Blanchette, Mathieu (Fall) Precup, Doina; Blanchette, Mathieu (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.

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, COMP 396, and COMP 400.

• COMP 230 Logic and Computability (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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 2013

  Instructors: Schlimm, Dirk (Fall)

  • 3 hours

  • Prerequisite: CEGEP level mathematics.

• COMP 251 Algorithms and Data Structures (3 credits)

  Offered by: Computer Science (Faculty of Science)

  Overview

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

  Terms: Fall 2013, Winter 2014

  Instructors: Panangaden, Prakash; Comanici, Gheorghe (Fall) Langer, Michael (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)

  Offered by: Computer Science (Faculty of Science)

  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 2013, Winter 2014

  Instructors: Vybihal, Joseph P (Fall) Kry, Paul (Winter)

  • 3 hours

  • Corequisite: COMP 206.

• COMP 280 History and Philosophy of Computing (3 credits)

  Offered by: Computer Science (Faculty of Science)

  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 2013-2014 academic year.

  Instructors: There are no professors associated with this course for the 2013-2014 academic year.

  • 3 hours

• MATH 222 Calculus 3 (3 credits)

  Offered by: Mathematics and Statistics (Faculty of Science)

  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 2013, Winter 2014, Summer 2014

  Instructors: Grieve, Nathan; L Kassaei, Payman (Fall) Jakobson, Dmitry (Winter) Trudeau, Sidney (Summer)

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

  Offered by: Mathematics and Statistics (Faculty of Science)

  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 2013

  Instructors: Addario-Berry, Dana Louis (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.