Note: The listing of a course in the Calendar is not a guarantee that the course is offered every year.

Note: Students must obtain a grade of at least C- in all courses used to fulfill prerequisite requirements. Otherwise, written permission of the appropriate Department Head or Program Co-ordinator must be obtained.

COMP 1631 (3CR)
INTRODUCTION TO COMPUTER SCIENCE
Format: lecture 3 hours, laboratory 3 hours
Prereq: university preparatory level course in Mathematics
Exclusion: COMP 1611, COMP 1711, any COMP 2000 level or higher
An introduction to computer science providing a broad survey of the discipline and an introduction to programming. Survey topics will be chosen from: origins of computers, data representation and storage, Boolean algebra, digital logic gates, computer architecture, assemblers and compilers, operating systems, networks and the Internet, theories of computation, and artificial intelligence.

COMP 1731 (3CR)
PROGRAMMING TECHNIQUES AND ALGORITHMS
Format: lecture 3 hours, laboratory 3 hours
Prereq: COMP 1631 or COMP 1711; or permission of the Department
Exclusion: COMP 1721
In the context of solving several larger problems, the techniques of topdown problem solving will be emphasized in order to further develop good programming style. Topics include: documentation, debugging and testing, string processing, internal searching and sorting, elementary data structures, recursion and algorithmic analysis.

COMP/MATH 2211 (3CR)
DISCRETE STRUCTURES
Format: lecture 3 hours
Prereq: MATH 1111; or permission of the Department
Note: This course is cross-listed as MATH 2211 and may therefore count as three credits in either discipline.
Exclusion: MATH 2211 Discrete Mathematics
An introduction to the terminology and concepts of discrete mathematics, covering such topics as: logical arguments, proofs and algorithm verification, sets, relations, functions and cardinality of sets, induction and recursion, enumeration, algorithms and complexity.

COMP 2611 (3CR)
DATA STRUCTURES AND ALGORITHMS I
Format: lecture 3 hours, laboratory 3 hours
Prereq: COMP 1731; or permission of the Department
Exclusion: any version of COMP 2611 previously offered with a different title
Effective methods of data organization, focussing on data structures and their algorithms via abstract data types with use of recursive procedures. Design of flexible file structures and related methods e.g. indexes, system file structures, hashed access. Object oriented programming techniques are used in depth.

COMP 2631 (3CR)
DATA STRUCTURES AND ALGORITHMS II
Format: lecture 3 hours, laboratory 3 hours
Prereq: COMP 2611; or permission of the Department
Advanced structures for data organization, with an emphasis on associated algorithms and their complexity. Topics include: binary and text file structures, compression, distributed computing, event-driven programming, advanced user interface design.

COMP 2931 (3CR)
INTRODUCTION TO SYSTEMS PROGRAMMING
Format: lecture 3 hours, laboratory 3 hours
Prereq: COMP 1731; or permission of the Department
Exclusion: COMP 2911
This course is an introduction to programming at the systems level. Topics include: basic machine organization, assembly language, the UNIX environment, shell scripting, and C/C++ programming.

COMP/PHYS 3361 (3CR)
DIGITAL SIGNAL PROCESSING AND ELECTRONICS
Format: lecture 3 hours, laboratory 3 hours
Prereq: COMP 1631 and PHYS 1551; or permission of the Department
Note: This course is cross-listed with PHYS 3361 and may therefore count as three credits in either discipline
This course introduces students to both digital electronic circuits and digital signal processing, and would be valuable both for those planning to go on in technical careers in computer science or in physics, and for scientists who wish to develop tools for the collection and analysis of data. Topics to be covered include digital logic gates, Boolean algebra, counting circuits, digital signal conditioning, sampling considerations such as the Nyquist criterion, analog to digital and digital to analog conversion, Fourier Transform theory and application as FFT, correlation and convolution, digital filtering using finite impulse response and infinite impulse response circuits including the ztransform and filter design, and digital image processing including two dimensional FFT techniques, microprocessors, microcontrollers and digital signal processing integrated circuits.

COMP/MATH 3411 (3CR)
NUMERICAL ANALYSIS
Format: lecture 3 hours
Prereq: MATH 1121, 2221, COMP 1631 or 1731 or 1751; or permission of the Department
Note: This course is cross listed as MATH 3411 and may therefore count as three credits in either discipline.
This course is an introduction to numerical methods for solving a variety of problems in mathematics, the natural sciences, and engineering. Topics to be studied include numerical solution of linear and nonlinear systems of equations, Gauss elimination, pivoting strategies, numerical stability, PLU factorization, tridiagonal matrices, polynomial and cubic spline approximation and interpolation.

COMP/MATH 3511 (3CR)
LINEAR PROGRAMMING
Format: lecture 3 hours
Prereq: MATH 2221, 3 credits in Computer Science; or permission of the Department
Note: This course is cross listed as MATH 3511 and may therefore count as three credits in either discipline.
Among the topics covered are linear and integer programming, the simplex and revised simplex methods, duality theory and sensitivity analysis, and various applications.

COMP/MATH 3531 (3CR)
SIMULATION AND MODELING
Format: lecture 3 hours
Prereq: MATH 1111; one of MATH 2311, 3311, PSYC 2001 and 2011; 3 credits in Computer Science; or permission of the Department
Note: This course is cross listed as MATH 3531 and may therefore count as three credits in either discipline.
An introduction to the simulation technique for studying mathematical models. Specific topics to be considered include: systems theory and system models, continuous system simulation, discrete system simulation, Monte Carlo methods, random number generators, and simulation languages. Emphasis will be placed upon computer implementation of the methods studied.

COMP 3611 (3CR)
ALGORITHM ANALYSIS
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, COMP/MATH 2211; or permission of the Department
The purpose of this course is to apply analysis and design techniques to nonnumeric algorithms which act on data structures. Designing efficient algorithms for internal and external sorting/merging/searching leads to notions of complexity (e.g. NP-hard problems) and to memory management techniques.

COMP 3651 (3CR)
ARTIFICIAL INTELLIGENCE
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, COMP/MATH 2211; or permission of the Department
This course introduces general problem solving methods associated with automated reasoning and simulated intelligence. Topics include: state space heuristic search theory, mechanical theorem proving, game playing, natural language processing, propositional logic, learning and cognitive models and expert systems.

COMP 3711 (3CR)
PRINCIPLES OF PROGRAMMING LANGUAGES
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, 2931; or permission of the Department
An introduction to the principles of design and implementation of procedural and functional programming languages; modular, object and logic programming. Topics include language syntax and processors and semantic models of data and control structures.

COMP 3721 (3CR)
OBJECT-ORIENTED DESIGN AND METHODOLOGY
Format: lecture 3 hours, laboratory 3 hours
Prereq: COMP 2631; or permission of the Department
Exclusion: COMP 2621 (Data and File Structures II), COMP 2711
Continues the introduction to object-oriented programming begun in earlier CS courses, emphasizing further development of algorithms, data structures, software engineering, and the social context of computing.

COMP 3811 (3CR)
DATABASE SYSTEMS
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, 2931, COMP/MATH 2211; or permission of the Department
An introduction to major types of database systems, and experience with at least one database model. The theoretical and practical aspects of the relational model are emphasized, including database query systems and database design.

COMP 3831 (3CR)
COMPUTER GRAPHICS
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, 2931, MATH 2221; or permission of the Department
This course introduces the principles and tools of interactive computer graphics: implementation of device drivers, 3D transformations, clipping, perspective views, input routines, user interface design, data structures, hidden lines, surface removal, colour shading and ray tracing.

COMP 3851 (3CR)
COMPUTERS AND SOCIETY
Format: lecture 3 hours
Prereq: 6 credits from the Science division, including 3 credits from Computer Science, and third or fourth-year standing; or permission of the Department
Note: Counts as a Commerce elective for students taking a Bachelor of Commerce or a Major or Minor in Commerce.
This course examines the historical development and growth of the computer and related digital technology. The impact of the computer and the digitalization of society are discussed, including ethical issues related to the modern information age. Privacy and data protection, computer crime, data theft, and legal issues in software creation and use are examined. The responsibilities of the computer professional and computer user are examined from the technical, personal, and societal perspectives.

COMP 3911 (3CR)
OPERATING SYSTEMS
Format: lecture 3 hours
Prereq: COMP 2931; or permission of the Department
This course includes the major concepts underlying the design of operating systems. Topics include: process management, scheduling, memory management, device management, system programming, security, and network structures.

COMP 3971 (3CR)
COMPUTER ORGANIZATION AND ARCHITECTURE
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, 2931; or permission of the Department
This course provides an introduction to modern computer design and its relation to system architecture and operating system functionality. Topics include: system bus design, memory organization, I/O device access, instruction set design, RISC computers, and parallel organization.

COMP/MATH 4631 (3CR)
THEORY OF COMPUTATION
Format: lecture 3 hours
Prereq: COMP 1721 or 1731, COMP/MATH 2211; or permission of the Department
Note: This course is cross listed as MATH 4631 and may therefore count as three credits in either discipline.
This course is an introduction to theoretical aspects of Computer Science such as formal language and automata theory and complexity theory.

COMP/MATH 4651 (3CR)
CRYPTOGRAPHY
Format: lecture 3 hours
Prereq: COMP 1631 or 1711, 1721 or 1731, COMP/MATH 2211; or permission of the Department
Note: This course is cross listed as MATH 4651 and may therefore count as three credits in either discipline.
This course is an introduction to cryptographic algorithms and to the cryptanalysis of these algorithms, with an emphasis on the fundamental principles of information security. Topics include: classical cryptosystems, modern block and stream ciphers, public-key ciphers, digital signatures, hash functions, key distribution and agreement.

COMP 4721 (3CR)
SOFTWARE DESIGN
Format: lecture 3 hours, laboratory 2 hours
Prereq: COMP 2631, 2711 or 3721, 2931, 6 credits in Computer Science at the 3000/4000 level, and third or fourth-year standing; or permission of the Department
This course includes the study of software design topics such as software life cycle, requirements specification, and quality ensurance. Software design topics such as strategies, intractable problems, concurrent systems, and data modeling are included. This course will include a large software project.

COMP 4911 (3CR)
COMPUTER NETWORKS
Format: lecture 3 hours
Prereq: COMP 2611 or 2631, 2931, and 3 credits from Computer Science at the 3/4000 level; or permission of the Department
An introduction to computer network applications and design. Topics will include: layered models, data transmission protocols, network topology, and security.

COMP 4950/4951 (6/3CR)
INDEPENDENT STUDY IN COMPUTER SCIENCE
Format: Independent Study
Prereq: Permission of the Department/Program Advisor. Students must obtain consent of an instructor who is willing to be a supervisor and must register for the course prior to the last day for change of registration in the term during which the course is being taken.
Note: A program on Independent Study cannot duplicate subject matter covered through regular course offerings.
Note: Students may register for COMP 4950/51 more than once, provided the subject matter differs.
This course permits senior students, under the direction faculty members, to pursue their interest in areas not covered, or not covered in depth, by other courses through a program of independent study.

COMP 4990 (6CR)
HONOURS THESIS
Format: Independent Study/Thesis
Prereq: Consent of supervising staff member and permission of the Department.
This course comprises independent research and study under the direction of a supervisor approved by the Department.

COMP 1991/2991/3991/4991 (3CR)
SPECIAL TOPIC IN COMPUTER SCIENCE
Format: Variable
Prereq: Set by the Department/Program when the topic and level are announced
Note: When a Department or Program intends to offer a course under this designation, it must submit course information, normally at least three months in advance, to the Dean.
Note: Students may register for COMP 1991/2991/3991/4991 more than once, provided the subject matter differs.
This course either focuses on topics not covered by the current course offerings in a department or program or offers the opportunity to pilot a course that is being considered for inclusion in the regular program.