![](/study/2016-2017/files/study.2016-2017/exclamation-point-small.png)
Note: This is the 2010–2011 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 2010–2011 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.
The School of Computer Science offers an extensive range of courses for Engineering students interested in computers. The course taken by students in most B.Eng. programs (COMP 208) and other courses included in the core of the various B.Eng. and B.S.E. programs are listed below.
See the course listing at ttp:// for other courses offered by the School of Computer Sciences (subject code COMP).
Computer Science (Sci) : Overview of components of microcomputers, the internet design and implementation of programs using a modern high-level language, an introduction to modular software design and debugging. Programming concepts are illustrated using a variety of application areas.
Terms: Fall 2010, Winter 2011, Summer 2011
Instructors: Petitpas, Mathieu; Frydrychowicz, Maja (Fall) Frydrychowicz, Maja; Pomerantz, Daniel (Winter) Pomerantz, Daniel (Summer)
Computer Science (Sci) : Introduction to computer systems. Concepts and structures for high level programming. Elements of structured programming using FORTRAN 90 and C. Numerical algorithms such as root finding, numerical integration and differential equations. Non-numerical algorithms for sorting and searching.
Terms: Fall 2010, Winter 2011
Instructors: Friedman, Nathan; Ranjbar, Amin; Rabbani, Amir Hossein (Fall) Friedman, Nathan; Rabbani, Amir Hossein; Meraji, Seyed Sina (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 2010, Winter 2011
Instructors: Precup, Doina (Fall) Langer, Michael (Winter)
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 2010, Winter 2011
Instructors: Pientka, Brigitte (Fall) Doherty, Jesse (Winter)
Note: COMP 202 and COMP 208 (compulsory for some Engineering students) do not form part of the Minor in Computer Science.
Minor Adviser: Students interested in this Minor should see Liette Chin, Undergraduate Program Coordinator, in the School of Computer Science (Lorne Trottier Building, Room 2070) to obtain the appropriate forms, and should see both the Minor Adviser in Computer Science and their department adviser for approval of their course selection. Forms must be submitted and approved before the end of the Course Change (drop/add) period of the student's final term.
Note: This Minor is open to B.Eng., B.S.E., and B.Sc.(Arch.) students in Engineering.
Engineering students may obtain the Computer Science minor as part of their B.Eng., B.S.E., or B.Sc.(Arch.) degree by completing the 24-credits of courses passed with a grade of C or better. In general, some complementary courses within B.Eng. and B.S.E. programs may be used to satisfy some of these requirements, but the Minor will require at least 12 extra credits from Computer Science (COMP) courses beyond those needed for the B.Eng. or B.S.E. degree. Students should consult their departments about the use of complementaries, and credits that can be double counted.
Note: COMP 202 and COMP 208 (compulsory for some Engineering students do not form part of the Minor in Computer Science.
For more information, see the School of Computer Science website: .
3 credits
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 2010, Winter 2011
Instructors: Vybihal, Joseph P (Fall) Vybihal, Joseph P; Dudek, Gregory L (Winter)
21 credits
3 credits from the following:
Computer Science (Sci) : Basic data structures. Representation of arrays, stacks, and queues. Linked lists and their applications to binary trees. Internal sorting. Graph representation. Elementary graph algorithms.
Terms: This course is not scheduled for the 2010-2011 academic year.
Instructors: There are no professors associated with this course for the 2010-2011 academic year.
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 2010, Winter 2011
Instructors: Precup, Doina (Fall) Langer, Michael (Winter)
3 credits from the following:
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 2010, Winter 2011
Instructors: Pientka, Brigitte (Fall) Doherty, Jesse (Winter)
Computer Science (Sci) : Principles, mechanisms, techniques, and tools for object-oriented software development: encapsulation, design patterns, unit testing, etc.
Terms: Fall 2010
Instructors: Robillard, Martin (Fall)
3 credits from the following:
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 2010, Winter 2011
Instructors: Vybihal, Joseph P (Fall) Siddiqi, Kaleem (Winter)
Electrical Engineering : Data representation in digital computers. Boolean algebra. Basic combinational circuits; their analysis and synthesis. Elements of sequential circuits: latches, flip-flops, counters and memory circuits. Computer structure, central processing unit, machine language. Assemblers and assembler language.
Terms: Fall 2010, Winter 2011
Instructors: Ferrie, Frank P (Fall) Liboiron-Ladouceur, Odile (Winter)
3 credits from the following:
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. Least-squares approximation. Iterative methods for solving a nonlinear equation. Discretization methods for integration and differential equations.
Terms: Fall 2010
Instructors: Chang, Xiao-Wen (Fall)
Mechanical Engineering : Numerical techniques for problems commonly encountered in Mechanical Engineering are presented. Chebyshev interpolation, quadrature, roots of equations in one or more variables, matrices, curve fitting, splines and ordinary differential equations. The emphasis is on the analysis and understanding of the problem rather than the details of the actual numerical program.
Terms: Winter 2011
Instructors: Daneshmand, Farhang (Winter)
0-3 credits from the following:
Computer Science (Sci) : Design and analysis of algorithms. Complexity of algorithms. Data structures. Introduction to graph algorithms and their analysis.
Terms: Fall 2010, Winter 2011
Instructors: Verbrugge, Clark (Fall) Crepeau, Claude (Winter)
6-9 credits chosen from other Computer Science courses at the 300- level or higher.
Notes:
A. COMP 203 and COMP 250 are considered to be equivalent from a prerequisite point of view, and cannot both be taken for credit.
B. COMP 208 may be taken before COMP 250; however, it cannot be taken for credit in the same term or afterward.
C. COMP 396 (Undergraduate Research Project) cannot be taken for credit toward this Minor.
Courses that make considerable use of computing from other departments may also be selected, with the approval of the School of Computer Science. Students should consult with their advisers about counting specific courses.