Minor Computer Science (24 credits)

Offered by: Computer Science     Degree: Bachelor of Science

Program Requirements

This Minor is designed for students who want to gain a basic understanding of computer science principles and get an overview of some computer science areas. Basic computer science skills are important in many domains. Thus, the Minor is useful for students majoring in any discipline. It can be taken in conjunction with any program in the Faculties of Science and Engineering (with the exception of other programs in Computer Science).

Students must obtain approval from the adviser of their main program. Students are strongly encouraged to talk to an adviser of the School of Computer Science before choosing the complementary courses. Approval must be given by the School for the particular selection of courses to be credited toward the Minor. This should be done before registering for the final term of studies.

Students may receive credit toward their Computer Science Minor by taking certain approved courses outside the School of Computer Science. These courses must have a high computer science content. A student will not be permitted to receive more than 6 credits from such courses. These courses must be approved by the School of Computer Science in advance. If a student's Major program requires Computer Science courses, up to 6 credits of Computer Science courses may be used to fulfil both Major and Minor requirements.

Required Courses (9 credits)

* Students who have sufficient knowledge in a programming language do not need to take COMP 202, but it must be replaced 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 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.

    Terms: Fall 2016, Winter 2017, Summer 2017

    Instructors: Kaleem Siddiqi, Melanie Lyman-Abramovitch, Daniel Pomerantz (Fall) Bentley Oakes, Giulia Alberini (Winter)

    • 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 2016, Winter 2017

    Instructors: David Meger (Fall) Joseph P Vybihal (Winter)

  • COMP 250 Introduction to Computer Science (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    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 non-recursive algorithms (searching and sorting, tree and graph traversal). Abstract data types, inheritance. Selected topics.

    Terms: Fall 2016, Winter 2017

    Instructors: Michael Langer (Fall) Mathieu Blanchette (Winter)

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

Complementary Courses (15 credits)

15 credits selected from the courses below and computer science courses at the 300 level or above (except COMP 364 and COMP 396).
* Note: COMP 251 is a prerequisite for many of the other complementary courses.

  • 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 2016, Winter 2017

    Instructors: Claude Crepeau (Fall) Jérôme Waldispuhl (Winter)

    • 3 hours

    • Prerequisite: COMP 250

    • 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 2016, Winter 2017

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

  • 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 2016, Winter 2017, Summer 2017

    Instructors: Stephen W Drury, Thomas F Fox (Fall) Alexander Garver (Winter)

  • 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 2016, Winter 2017

    Instructors: Frederick Shepherd (Winter)

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

Faculty of Science—2016-2017 (last updated Aug. 26, 2016) (disclaimer)