Computer Science (Faculty of Arts)
Computer science encompasses everything from theory to applications, including software engineering, programming languages, robotics, compilers, databases, game design and development, operating systems, artificial intelligence, computational biology, computer vision, and the analysis of algorithms.
A universitylevel education in computer science will help you develop your analytical thinking and creative problem solving skills while studying a wealth of exciting topics with a wide range of applications (from medicine to business). An undergraduate education in computer science will also open the door to careers in a variety of companies (engineering, hightech, pharmaceutical).
You can study Computer Science at McGill in many different ways. Some students choose to complete a B.A. degree. In fact, it is possible to get quite a strong training in Computer Science within the B.A. degree program by taking both the Computer Science Major Concentration along with the Supplementary Minor in Computer Science. In terms of Computer Science content, this is almost the same at the B.Sc. major in Computer Science. You will be taking the same Computer Science classes and you will work in the same stateoftheart computer labs as students in the B.Sc. program. In fact, in the classes and labs there are no distinctions between students in the B.A. program and students in the B.Sc. program  they are equal.
The B.A. degree is suitable for you if your background does not include very much Science, but you do have a good background in Mathematics and you have an interest and aptitude for logical reasoning.
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.
DETAILED PROGRAM OUTLINES:
Program Requirement:
This Major concentration represents an indepth introduction to computer science and its subareas. 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 Multitrack System options.
Required Courses (18 credits)
MATH 133, MATH 140, and MATH 141 (or their equivalents) should be completed prior to taking courses in this program.
Notes for the list below:
* Students who have sufficient knowledge in programming 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*
 Fall
 Winter
 Summer
Offered in the: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.
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
 Symbols:
 *
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Giulia Alberini, Elizabeth Patitsas
 Giulia Alberini

COMP 206 Intro to Software Systems 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Joseph P Vybihal
 Joseph P Vybihal

COMP 250 Intro to Computer Science 3 Credits
 Fall
 Winter
 Summer
Offered in the: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 nonrecursive algorithms (searching and sorting, tree and graph traversal). Abstract data types, inheritance. Selected topics.
Offered by: Computer Science
 3 hours
 Prerequisites: Familiarity with a high level programming language and CEGEP level Math.
 Students with limited programming experience should take COMP 202 or equivalent before COMP 250. See COMP 202 Course Description for a list of topics.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Michael Langer, Giulia Alberini
 Reihaneh Rabbany, Giulia Alberini

COMP 251 Algorithms and Data Structures 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Corequisite(s): MATH 235 or MATH 240 or MATH 363.
 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.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jérôme Waldispuhl
 Adrian Roshan Vetta

COMP 273 Intro to Computer Systems 3 Credits
 Fall
 Winter
 Summer
Offered in the:Computer Science (Sci): Number representations, combinational and sequential digital circuits, MIPS instructions and architecture datapath and control, caches, virtual memory, interrupts and exceptions, pipelining.
Offered by: Computer Science
 3 hours
 Corequisite: COMP 206.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Joseph P Vybihal
 Kaleem Siddiqi

MATH 240 Discrete Structures 3 Credits
 Fall
 Winter
 Summer
Offered in the:Mathematics & Statistics (Sci): Introduction to discrete mathematics and applications. Logical reasoning and methods of proof. Elementary number theory and cryptography: prime numbers, modular equations, RSA encryption. Combinatorics: basic enumeration, combinatorial methods, recurrence equations. Graph theory: trees, cycles, planar graphs.
Offered by: Mathematics and Statistics
 Fall and Winter
 Corequisite: MATH 133.
 Restriction: For students in any Computer Science, Computer Engineering, or Software Engineering programs. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jeremy D Macdonald
 Jeremy D Macdonald
Complementary Courses (18 credits)
18 credits selected as follows:
3 credits from each of the groups A, B, C, and D:
Group A:

MATH 222 Calculus 3 3 Credits
 Fall
 Winter
 Summer
Offered in the: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 201303 or MATH 150, MATH 151 or MATH 227
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jeremy D Macdonald
 Jérôme Fortier

MATH 323 Probability 3 Credits
 Fall
 Winter
 Summer
Offered in the: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.
Offered by: Mathematics and Statistics
 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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jose Andres Correa
 David B Wolfson, Djivede A Kelome

MATH 324 Statistics 3 Credits
 Fall
 Winter
 Summer
Offered in the:Mathematics & Statistics (Sci): Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Offered by: Mathematics and Statistics
 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.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Masoud AsgharianDastenaei
Group B:

MATH 223 Linear Algebra 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Djivede A Kelome
 Jeremy D Macdonald

MATH 318 Mathematical Logic 3 Credits
 Fall
 Winter
 Summer
Offered in the:Mathematics & Statistics (Sci): Propositional logic: truthtables, formal proof systems, completeness and compactness theorems, Boolean algebras; firstorder logic: formal proofs, Gödel's completeness theorem; axiomatic theories; set theory; Cantor's theorem, axiom of choice and Zorn's lemma, Peano arithmetic; Gödel's incompleteness theorem.
Offered by: Mathematics and Statistics
 Symbols:
 Terms
 Fall 2019
 Instructors
 Marcin Sabok

MATH 340 Discrete Structures 2 3 Credits
 Fall
 Winter
 Summer
Offered in the: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.
Offered by: Mathematics and Statistics
 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.
 Symbols:
 Terms
 Winter 2020
 Instructors
 Jérôme Fortier
Group C:

COMP 330 Theory of Computation 3 Credits
 Fall
 Winter
 Summer
Offered in the:Computer Science (Sci): Finite automata, regular languages, contextfree languages, pushdown automata, models of computation, computability theory, undecidability, reduction techniques.
Offered by: Computer Science
 3 hours
 Prerequisite: COMP 251.
 Symbols:
 Terms
 Fall 2019
 Instructors
 Claude Crepeau

COMP 350 Numerical Computing 3 Credits
 Fall
 Winter
 Summer
Offered in the: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. Leastsquares approximation. Iterative methods for solving a nonlinear equation. Discretization methods for integration and differential equations.
Offered by: Computer Science
 3 hours
 Prerequisites: MATH 222 and MATH 223 and one of: COMP 202, COMP 208, COMP 250; or equivalents.
 Restrictions: Students cannot receive credit for both COMP 350 and MATH 317.
 Symbols:
 Terms
 Fall 2019
 Instructors
 There are no professors associated with this course for the 20192020 academic year

COMP 360 Algorithm Design 3 Credits
 Fall
 Winter
 Summer
Offered in the:Computer Science (Sci): Advanced algorithm design and analysis. Linear programming, complexity and NPcompleteness, 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.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Hamed Hatami
Group D:

COMP 302 Programming Lang & Paradigms 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Brigitte Pientka
 Prakash Panangaden

COMP 303 Software Design 3 Credits
 Fall
 Winter
 Summer
Offered in the:Computer Science (Sci): Principles, mechanisms, techniques, and tools for objectoriented software design and its implementation, including encapsulation, design patterns, and unit testing.
Offered by: Computer Science
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Martin Robillard
 Jin Guo
An additional 3 credits may be selected from Group A or B.
The remaining complementary credits must be selected from COMP 230 and COMP courses at the 300 level or above (except COMP 364, COMP 396).
Program Requirement:
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)
* Students who have sufficient knowledge of programming should not take COMP 202, and instead should replace it with an additional Computer Science complementary course.

COMP 202 Foundations of Programming 3 Credits*
 Fall
 Winter
 Summer
Offered in the: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.
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
 Symbols:
 *
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Giulia Alberini, Elizabeth Patitsas
 Giulia Alberini

COMP 206 Intro to Software Systems 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Joseph P Vybihal
 Joseph P Vybihal

COMP 250 Intro to Computer Science 3 Credits
 Fall
 Winter
 Summer
Offered in the: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 nonrecursive algorithms (searching and sorting, tree and graph traversal). Abstract data types, inheritance. Selected topics.
Offered by: Computer Science
 3 hours
 Prerequisites: Familiarity with a high level programming language and CEGEP level Math.
 Students with limited programming experience should take COMP 202 or equivalent before COMP 250. See COMP 202 Course Description for a list of topics.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Michael Langer, Giulia Alberini
 Reihaneh Rabbany, Giulia Alberini
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
 Fall
 Winter
 Summer
Offered in the:Computer Science (Sci): Propositional Logic, predicate calculus, proof systems, computability Turing machines, ChurchTuring thesis, unsolvable problems, completeness, incompleteness, Tarski semantics, uses and misuses of Gödel's theorem.
Offered by: Computer Science
 3 hours
 Prerequisite: CEGEP level mathematics.
 Symbols:
 Terms
 Fall 2019
 Instructors
 Dirk Schlimm

COMP 251 Algorithms and Data Structures 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Corequisite(s): MATH 235 or MATH 240 or MATH 363.
 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.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jérôme Waldispuhl
 Adrian Roshan Vetta

COMP 273 Intro to Computer Systems 3 Credits
 Fall
 Winter
 Summer
Offered in the:Computer Science (Sci): Number representations, combinational and sequential digital circuits, MIPS instructions and architecture datapath and control, caches, virtual memory, interrupts and exceptions, pipelining.
Offered by: Computer Science
 3 hours
 Corequisite: COMP 206.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Joseph P Vybihal
 Kaleem Siddiqi

COMP 280 Hist and Phil of Computing 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Symbols:
 Terms
 This course is not scheduled for the 20192020 academic year
 Instructors
 There are no professors associated with this course for the 20192020 academic year

MATH 240 Discrete Structures 3 Credits
 Fall
 Winter
 Summer
Offered in the:Mathematics & Statistics (Sci): Introduction to discrete mathematics and applications. Logical reasoning and methods of proof. Elementary number theory and cryptography: prime numbers, modular equations, RSA encryption. Combinatorics: basic enumeration, combinatorial methods, recurrence equations. Graph theory: trees, cycles, planar graphs.
Offered by: Mathematics and Statistics
 Fall and Winter
 Corequisite: MATH 133.
 Restriction: For students in any Computer Science, Computer Engineering, or Software Engineering programs. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jeremy D Macdonald
 Jeremy D Macdonald
Program Requirement:
The Supplementary Minor Concentration may be taken only by students registered in the Major Concentration Computer Science or the Major Concentration Software Engineering. There may be no overlap in credits taken for this Supplementary Minor Concentration and the Major Concentration Computer Science/Software Engineering. Taken together, these constitute a program very close to the Major Computer Science offered by the Faculty of Science. Students must get their selection of courses approved by an Academic Adviser in the School of Computer Science.
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 Multitrack System options.
Complementary Courses (18 credits)
18 credits selected from Computer Science (COMP) courses at the 300 level or above excluding COMP 364 and COMP 396.
Students may also select a maximum of 3 credits of MATH courses from the list below.

MATH 223 Linear Algebra 3 Credits
 Fall
 Winter
 Summer
Offered in the: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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Djivede A Kelome
 Jeremy D Macdonald

MATH 318 Mathematical Logic 3 Credits
 Fall
 Winter
 Summer
Offered in the:Mathematics & Statistics (Sci): Propositional logic: truthtables, formal proof systems, completeness and compactness theorems, Boolean algebras; firstorder logic: formal proofs, Gödel's completeness theorem; axiomatic theories; set theory; Cantor's theorem, axiom of choice and Zorn's lemma, Peano arithmetic; Gödel's incompleteness theorem.
Offered by: Mathematics and Statistics
 Symbols:
 Terms
 Fall 2019
 Instructors
 Marcin Sabok

MATH 323 Probability 3 Credits
 Fall
 Winter
 Summer
Offered in the: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.
Offered by: Mathematics and Statistics
 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
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Jose Andres Correa
 David B Wolfson, Djivede A Kelome

MATH 324 Statistics 3 Credits
 Fall
 Winter
 Summer
Offered in the:Mathematics & Statistics (Sci): Sampling distributions, point and interval estimation, hypothesis testing, analysis of variance, contingency tables, nonparametric inference, regression, Bayesian inference.
Offered by: Mathematics and Statistics
 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.
 Symbols:
 Terms
 Fall 2019
 Winter 2020
 Instructors
 Masoud AsgharianDastenaei

MATH 340 Discrete Structures 2 3 Credits
 Fall
 Winter
 Summer
Offered in the: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.
Offered by: Mathematics and Statistics
 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.
 Symbols:
 Terms
 Winter 2020
 Instructors
 Jérôme Fortier