![](/study/2016-2017/files/study.2016-2017/exclamation-point-small.png)
Note: This is the 2011–2012 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
Note: This is the 2011–2012 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.
* 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.
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 2011, Winter 2012, Summer 2012
Instructors: Pomerantz, Daniel; Kienzle, Jorg Andreas (Fall) Pomerantz, Daniel; Liu, Xue (Winter) Pomerantz, Daniel (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
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 2011, Winter 2012
Instructors: Vybihal, Joseph P (Fall) Vybihal, Joseph P; Dudek, Gregory L; He, Wenbo (Winter)
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 2011, Winter 2012
Instructors: Precup, Doina (Fall) Blanchette, Mathieu (Winter)
Computer Science (Sci) : Introduction to algorithm design and analysis. Graph algorithms, greedy algorithms, data structures, dynamic programming, maximum flows.
Terms: Fall 2011, Winter 2012
Instructors: Sigler, Andrea Jordana (Fall) Avis, David (Winter)
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 2011, Winter 2012
Instructors: Kry, Paul (Fall) Langer, Michael (Winter)
3 hours
Corequisite: COMP 206.
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 2011, Winter 2012
Instructors: Boespflug, Mathieu (Fall) Pientka, Brigitte (Winter)
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for object-oriented software development: encapsulation, design patterns, unit testing, etc.
Terms: Fall 2011
Instructors: Verbrugge, Clark (Fall)
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 2011, Winter 2012
Instructors: Tropper, Carl (Fall) Maheswaran, Muthucumaru (Winter)
3 hours
Prerequisite: COMP 273
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 2011
Instructors: Vybihal, Joseph P (Fall)
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
Computer Science (Sci) : See COMP 361D1 for course description.
Terms: Winter 2012
Instructors: Vybihal, Joseph P (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
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 2011, Winter 2012
Instructors: Jonsson, Wilbur (Fall) Jonsson, Wilbur (Winter)
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 2011
Instructors: Norin, Sergey (Fall)
3 credits selected from:
Computer Science (Sci) : Mathematical models of computers, finite automata, Turing machines, counter machines, push-down machines, computational complexity.
Terms: Fall 2011
Instructors: Panangaden, Prakash (Fall)
3 hours
Prerequisite: COMP 251.
Computer Science (Sci) : Advanced algorithm design and analysis. Linear programming, complexity and NP-completeness, advanced algorithmic techniques.
Terms: Fall 2011, Winter 2012
Instructors: Hatami, Hamed (Fall) Vetta, Adrian Roshan (Winter)
9-10 credits selected from the courses below:
* Students take either COMP 435 or COMP 535, but not both.
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 2012
Instructors: Pomerantz, Daniel (Winter)
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 2011-2012 academic year.
Instructors: There are no professors associated with this course for the 2011-2012 academic year.
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 2012
Instructors: Kemme, Bettina (Winter)
Computer Science (Sci) : Exposition of the first four layers of the ISO model for computer network protocols. Socket programming. Network administration and configuration and security issues.
Terms: This course is not scheduled for the 2011-2012 academic year.
Instructors: There are no professors associated with this course for the 2011-2012 academic year.
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 2011
Instructors: Al Marhubi, Kamal Amran (Fall)
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: Winter 2012
Instructors: Panangaden, Prakash (Winter)
Computer Science (Sci) : Development, analysis, and maintenance of software architectures, with special focus on modular decomposition and reverse engineering.
Terms: This course is not scheduled for the 2011-2012 academic year.
Instructors: There are no professors associated with this course for the 2011-2012 academic year.
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: This course is not scheduled for the 2011-2012 academic year.
Instructors: There are no professors associated with this course for the 2011-2012 academic year.
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 2011
Instructors: Maheswaran, Muthucumaru (Fall)
Or any computer science course at the 300 level or above, excluding COMP 364, COMP 396, and COMP 431.