Feedback

Note: This is the 20122013 edition of the eCalendar. For the most recent publication, click here.

Liberal Program - Core Science Component Software Engineering (49 credits)

Offered by: Computer Science     Degree: Bachelor of Science

Program Requirements

This program covers a core of programming and software engineering courses and allows students to select courses that aim at practical aspects of software development.

Students may complete this program with a minimum of 48 credits or a maximum of 49 credits depending on their choice of complementary courses.

Required Courses (36 credits)

* Students who have sufficient knowledge in a programming language do not need to take COMP 202 and can replace it with additional computer science complementary course credits.

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

    Instructors: Daniel Pomerantz, Xue Liu, Ioannis Rekleitis (Fall) Jorg Andreas Kienzle, Daniel Pomerantz (Winter) Daniel Pomerantz (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 2012, Winter 2013

    Instructors: Joseph P Vybihal, Gregory L Dudek (Fall) Wenbo He, Gregory L Dudek (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 2012, Winter 2013

    Instructors: Michael Langer (Fall) Mathieu Blanchette (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 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 2012, Winter 2013

    Instructors: Prakash Panangaden (Fall) Clark Verbrugge (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 2012, Winter 2013

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

    • 3 hours
    • Corequisite: COMP 206.
  • COMP 302 Programming Languages and Paradigms (3 credits)

    Offered by: Computer Science (Faculty of Science)

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

    Instructors: Brigitte Pientka (Fall)

    • 3 hours
    • Prerequisite: COMP 250 or COMP 203
  • COMP 303 Software Development (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Principles, mechanisms, techniques, and tools for object-oriented software development: encapsulation, design patterns, unit testing, etc.

    Terms: Fall 2012

    Instructors: Martin Robillard (Fall)

    • 3 hours
    • Prerequisites: COMP 206, COMP 250.
    • The course involves a significant project.
  • COMP 310 Operating Systems (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Control and scheduling of large information processing systems. Operating system software - resource allocation, dispatching, processors, access methods, job control languages, main storage management. Batch processing, multiprogramming, multiprocessing, time sharing.

    Terms: Fall 2012, Winter 2013

    Instructors: Xue Liu (Fall) Muthucumaru Maheswaran (Winter)

    • 3 hours
    • Prerequisite: COMP 273
  • COMP 361D1 Software Engineering Project (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Software development process in practice: requirement elicitation and analysis, software design, implementation, integration, test planning, and maintenance. Application of the core concepts and techniques through the realization of a large software system.

    Terms: Fall 2012

    Instructors: Joseph P Vybihal, Jorg Andreas Kienzle (Fall)

    • Prerequisites: COMP 206, COMP 250
    • Corequisite: COMP 303
    • Restriction: Not open to students who have taken the 3 credit version of COMP 361.
    • Students must register for both COMP 361D1 and COMP 361D2
    • No credit will be given for this course unless both COMP 361D1 and COMP 361D2 are successfully completed in consecutive terms
  • COMP 361D2 Software Engineering Project (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : See COMP 361D1 for course description.

    Terms: Winter 2013

    Instructors: Joseph P Vybihal, Jorg Andreas Kienzle (Winter)

    • Prerequisite: COMP 361D1
    • No credit will be given for this course unless both COMP 361D1 and COMP 361D2 are successfully completed in consecutive terms
  • MATH 223 Linear Algebra (3 credits)

    Offered by: Mathematics and Statistics (Faculty of Science)

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

    Instructors: Layan El Hajj, Wilbur Jonsson (Fall) Wilbur Jonsson (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 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 2012

    Instructors: Dana Louis Addario-Berry (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 (13 credits)

3 credits selected from:

  • COMP 330 Theory of Computation (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

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

    Terms: Fall 2012

    Instructors: Claude Crepeau (Fall)

    • 3 hours
    • Prerequisite: COMP 251.
  • COMP 360 Algorithm Design (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

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

    Terms: Fall 2012, Winter 2013

    Instructors: Hamed Hatami (Fall) Adrian Roshan Vetta (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.

9-10 credits selected from the courses below:

  • COMP 322 Introduction to C++ (1 credit)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Basics and advanced features of the C++ language. Syntax, memory management, class structure, method and operator overloading, multiple inheritance, access control, stream I/O, templates, exception handling.

    Terms: Winter 2013

    Instructors: Daniel Pomerantz (Winter)

    • 1 hour
    • Prerequisites: COMP 202 or COMP 250 or COMP 206 or COMP 208. Ability to program in general is presumed. Some familiarity with the C language is assumed.
  • COMP 409 Concurrent Programming (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    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.

    Terms: This course is not scheduled for the 2012-2013 academic year.

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

    • 3 hours
    • Prerequisites: COMP 251, COMP 302, and COMP 310 or ECSE 427
  • COMP 421 Database Systems (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    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.

    Terms: Winter 2013

    Instructors: Bettina Kemme (Winter)

    • 3 hours
    • Prerequisites: COMP 206, COMP 251, COMP 302
  • COMP 520 Compiler Design (4 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : The structure of a compiler. Lexical analysis. Parsing techniques. Syntax directed translation. Run-time implementation of various programming language constructs. Introduction to code generation for an idealized machine. Students will implement parts of a compiler.

    Terms: Fall 2012

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

    • 3 hours, 1 hour consultation
    • Prerequisites: COMP 273 and COMP 302
  • COMP 525 Formal Verification (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Propositional logic - syntax and semantics, temporal logic, other modal logics, model checking, symbolic model checking, binary decision diagrams, other approaches to formal verification.

    Terms: This course is not scheduled for the 2012-2013 academic year.

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

    • 3 hours
    • Prerequisites: COMP 251 and COMP 330.
  • COMP 529 Software Architecture (4 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Development, analysis, and maintenance of software architectures, with special focus on modular decomposition and reverse engineering.

    Terms: Winter 2013

    Instructors: Martin Robillard (Winter)

    • 4 hours
    • Prerequisite: COMP 303 or COMP 304.
  • COMP 533 Object-Oriented Software Development (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Object-oriented, UML-based software development; requirements engineering based on use cases; using OCL and a coherent subset of UML to establish complete and precise analysis and design documents for a software system; Java-specific mapping strategies for implementation.

    Terms: Fall 2012

    Instructors: Jorg Andreas Kienzle (Fall)

    • 3 hours
    • Prerequisite: COMP 335 or ECSE 321 or COMP 303 or COMP 361
  • COMP 535 Computer Networks 1 (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Exposition of the first four layers of the ISO model for computer network protocols, i.e., the physical, data, network, and transport layers. Basic hardware and software issues with examples drawn from existing networks, notably SNA, DECnet, and ARPAnet.

    Terms: Fall 2012

    Instructors: Muthucumaru Maheswaran (Fall)

    • 3 hours
    • Prerequisite: COMP 310
    • Restriction: Students may not take both COMP 435 and COMP 535 for credit

Or any computer science course at the 300 level or above, excluding COMP 364, COMP 396, and COMP 400.

Faculty of Science—2012-2013 (last updated Dec. 20, 2012) (disclaimer)