Course & Lab Timetable

Section	Day	Time	Instructor	Exam Date	Delivery
2022 Fall 2023 Winter
CS 051 - Computer Science Co-op Work Term
Four-month co-op work term approved by the department and arranged by the co-op co-ordinator.
001		-	Samira Sadaoui-Mouhoub
CS 052 - Computer Science Co-op Work Term
Four-month co-op work term #2 approved by the department and arranged by the co-op coordinator. * Prerequisite: CS 051 *
001		-	Samira Sadaoui-Mouhoub
CS 053 - Computer Science Co-op Work Term
Four-month co-op work term #3 approved by the department and arranged by the co-op coodinator. * Prerequisite: CS 052 *
001		-	Samira Sadaoui-Mouhoub
CS 054 - Computer Science Co-op Work Term
Four-month co-op work term #4 approved by the department and arranged by the co-op coordinator. * Prerequisite: CS 053 *
001		-	Samira Sadaoui-Mouhoub
CS 055 - Computer Science Co-op Work Term
Four-month co-op work term #5 approved by the department and arranged by the co-op coordinator. * Prerequisite: CS 054 *
001		-	Samira Sadaoui-Mouhoub
CS 100 - Introduction to Computers
Introduction to the development of computers and computer applications. Topics will include: impact of computers on society, computer organization and operation, construction and representation of algorithms, and applications of computers in the problem-solving process. Note: This class may not be taken for credit if credit has been received for any course numbered above CS 100
001	T	7:00pm - 9:45pm	Lalit Goyal	13-DEC-22	RMTE
080	M	09:30am - 11:20am	STAFF		RMTE
081	T	09:30am - 11:20am	STAFF		RMTE
082	T	11:30am - 1:20pm	STAFF		RMTE
083	T	4:30pm - 6:20pm	STAFF		RMTE
084	W	10:30am - 12:20pm	STAFF		RMTE
085	W	12:30pm - 2:20pm	STAFF		RMTE
086	W	5:30pm - 7:20pm	STAFF		RMTE
087	R	10:30am - 12:20pm	STAFF		RMTE
089	R	5:30pm - 7:20pm	STAFF		RMTE
S01	MW	2:30pm - 3:45pm	Richard Dosselmann	12-DEC-22
S02	MW	2:30pm - 3:45pm	Richard Dosselmann	12-DEC-22
S03	F	12:30pm - 2:20pm	Vatika Tayal
S04	F	09:30am - 11:20am	Vatika Tayal
S05	R	12:30pm - 2:20pm	Vatika Tayal
S06	R	09:30am - 11:20am	Vatika Tayal
S07	W	12:30pm - 2:20pm	Vatika Tayal
CS 110 - Programming and Problem Solving
An introduction to problem-solving techniques, the fundamental concepts of programming, and the software design process. Topics will include: data types, control structures, scope rules, functions, files, and the mechanics of running, testing and debugging. Problems will be drawn from various science disciplines. *Prerequisite: Precalculus 30, Calculus 30, or Math 102* Note: CS majors who have mastered the course material in CS 110 through other means are eligible to write the CS 110 bypass exam.
001	MWF	10:30am - 11:20am	Carlos Valenzuela Ruiz	16-DEC-22
002	MW	11:30am - 12:45pm	Mandana Gholamigazafrudy	16-DEC-22
003	MWF	4:30pm - 5:20pm	Mandana Gholamigazafrudy	16-DEC-22	RMTE
070	R	09:30am - 11:20am	STAFF		RMTE
071	M	1:30pm - 3:20pm	STAFF		RMTE
072	M	6:30pm - 8:20pm	STAFF		RMTE
073	W	1:30pm - 3:20pm	STAFF		RMTE
074	W	6:30pm - 8:20pm	STAFF		RMTE
075	R	11:30am - 1:20pm	STAFF		RMTE
080	R	1:30pm - 3:20pm	STAFF
081	W	1:30pm - 3:20pm	STAFF
082	W	11:30am - 1:20pm	STAFF
083	R	6:30pm - 8:20pm	STAFF
084	T	3:30pm - 5:20pm	STAFF
085	W	6:30pm - 8:20pm	STAFF
086	R	5:30pm - 7:20pm	STAFF
090	T	1:30pm - 3:20pm	STAFF
091	T	11:30am - 1:20pm	STAFF
092	T	09:30am - 11:20am	STAFF
093	R	3:30pm - 5:20pm	STAFF
094	R	11:30am - 1:20pm	STAFF
095	W	4:00pm - 5:50pm	STAFF
096	T	5:30pm - 7:20pm	STAFF
S01	TR	4:00pm - 5:15pm	Richard Dosselmann	16-DEC-22
S02	TR	4:00pm - 5:15pm	Richard Dosselmann	16-DEC-22
S03	W	09:30am - 11:20am	Vatika Tayal
S04	T	12:30pm - 2:20pm	Vatika Tayal
S05	T	09:30am - 11:20am	Vatika Tayal
S06	M	12:30pm - 2:20pm	Vatika Tayal
S07	M	09:30am - 11:20am	Vatika Tayal
CS 115 - Object-Oriented Design
This course focuses on the concepts of object-oriented programming. Topics include data abstraction, classes, composition and inheritance, subtyping, dynamic binding, polymorphism and dynamic memory management. Other topics include type systems, two-dimensional arrays, records, references, searching and sorting algorithms, language translation. Software engineering: comprehensibility, correctness, efficiency, refactoring. *Prerequisite: CS 110 with a minimum grade of 65% and one of MATH 110 (may be taken concurrently) or MATH 103 with a minimum grade of 80%.*
001	MWF	2:30pm - 3:20pm	Philip Pitura	17-DEC-22
002	MWF	2:30pm - 3:20pm	Philip Pitura	17-DEC-22
003	MWF	4:30pm - 5:20pm	Seyedmohammad Mirbagheritabatabaei	17-DEC-22	RMTE
071	W	5:30pm - 7:20pm	STAFF		RMTE
072	W	11:30am - 1:20pm	STAFF		RMTE
073	T	5:30pm - 7:20pm	STAFF		RMTE
074	R	09:30am - 11:20am	STAFF		RMTE
081	R	11:30am - 1:20pm	STAFF
082	R	09:30am - 11:20am	STAFF
083	W	12:30pm - 2:20pm	STAFF
091	W	09:30am - 11:20am	STAFF
092	T	12:30pm - 2:20pm	STAFF
093	T	2:30pm - 4:20pm	STAFF
CS 201 - Introduction to Digital Systems
Hardware paradigms, logic minimization, sequential and combinational circuits, register transfer notation. Numerical data representation, number bases, floating-point and two’s-complement representation, representation of non-numeric data, records and arrays. Von Neumann architecture, control units, instruction sets, assembly language programming, addressing modes, subroutines, basic building blocks, computer components. *Prerequisite: CS 110*
001	TR	4:30pm - 5:45pm	Sultan Ahmed	19-DEC-22
002	MW	5:30pm - 6:45pm	Sultan Ahmed	19-DEC-22	RMTE
080	M	09:30am - 11:20am	STAFF		RMTE
081	T	4:30pm - 6:20pm	STAFF		RMTE
082	T	6:30pm - 8:20pm	STAFF		RMTE
083	M	11:30am - 1:20pm	STAFF		RMTE
084	W	1:30pm - 3:20pm	STAFF		RMTE
093	W	09:30am - 11:20am	STAFF
094	T	1:30pm - 3:20pm	STAFF
095	W	3:30pm - 5:20pm	STAFF
096	W	1:30pm - 3:20pm	STAFF
097	W	5:30pm - 7:20pm	STAFF
CS 203 - Java Programming and Applications
Learn to program in the Java programming language. Topics will include the basic building blocks of procedural programming, object-oriented programming, event-oriented programming, graphical user interfaces, simple data structures including arrays and linked lists, and advanced topic including recursion and threads. Problems will be drawn from various science and engineering disciplines. * Prerequisite: CS 115. *
001	TR	6:00pm - 7:15pm	Richmond Osei	13-DEC-22
CS 210 - Data Structures and Abstractions
This course introduces data abstraction, data structures and their implementations, the basics of algorithmic analysis, and the fundamental computing algorithms. Topics include stacks, queues, heaps, recursion, Master Theorem, asymptotic notation, computational complexity, empirical performance measurement, recursion based sorting algorithms, hashing, and trees (including binary trees, B-trees, and AVL trees). * Prerequisite: CS 115 and MATH 110 *
001	MW	11:30am - 12:45pm	Sultan Ahmed	19-DEC-22
090	R	11:30am - 1:20pm	STAFF
091	F	1:30pm - 3:20pm	STAFF
092	F	3:30pm - 5:20pm	STAFF
093	M	09:30am - 11:20am	STAFF
094	M	1:30pm - 3:20pm	STAFF
095	T	11:30am - 1:20pm	STAFF
096	T	09:30am - 11:20am	STAFF
098	F	11:30am - 1:20pm	STAFF
099	F	09:30am - 11:20am	STAFF
CS 215 - Web and Database Programming
This course shows how interactive database-driven web applications are designed and implemented. Appropriate protocols and languages for web and database programming will be discussed, with a focus on client-server architectures, interface design, graphics and visualization, event-driven programming, information management, data modeling, and database systems. *Prerequisite: CS 210*
081	T	09:30am - 11:20am	STAFF		RMTE
082	T	11:30am - 1:20pm	STAFF		RMTE
083	T	2:30pm - 4:20pm	STAFF		RMTE
084	W	09:30am - 11:20am	STAFF		RMTE
091	T	09:30am - 11:20am	STAFF		RMTE
092	T	11:30am - 1:20pm	STAFF		RMTE
093	T	2:30pm - 4:20pm	STAFF		RMTE
094	W	09:30am - 11:20am	STAFF		RMTE
397		-	Abbas Pirmoradi Bezanjani	21-DEC-22	BLEND
397	R	11:30am - 12:45pm	Abbas Pirmoradi Bezanjani	21-DEC-22	BLEND
398		-	Chris Street	21-DEC-22	BLEND
398	R	11:30am - 12:45pm	Chris Street	21-DEC-22	BLEND
CS 261 - Methods in Numerical Analysis
Topics will include number systems and errors, solutions of polynomial and other nonlinear equations, interpolation, numerical differentiation and integration, and the cubic spline. *Prerequisite: CS 110 or 115, MATH 111 and 122* Note: Students will receive credit for only one of CS 261 or MATH 261
001	MW	10:00am - 11:15am	Iqbal Husain	14-DEC-22
098	T	09:30am - 11:20am	Sarah Carnochan Naqvi
099	M	12:30pm - 2:20pm	Sarah Carnochan Naqvi
CS 280 - Risk and Reward in the Information Society
Social context of computing. Case study: human-computer interfaces and their evaluation. Methods and tools of analysis. Professional and ethical responsibilities. Risks and liabilities of computer-based systems. Intellectual property, privacy and civil liberties. Professional communication. Sustainability. Cybercrime. *Prerequisite: ENGL 100 and CS 110 *
001		-	Daryl Hepting
CS 301 - Digital Systems Architecture
Latency and bandwidth, cache memory, virtual memory, data compression, fault handling. Fundamentals of I/O, interrupts, external storage, buses, networks, multimedia support. Multiprocessor and parallel architectures, parallel decomposition, pipelining, shared memory systems, interconnection networks, cache consistency, memory consistency. Computational paradigms, performance evaluation, and effect of proximity. * Prerequisite: CS 201 *
001	M	4:30pm - 7:15pm	Maher Elshakankiri	09-DEC-22	RMTE
090	M	11:30am - 1:20pm	STAFF
091	T	4:30pm - 6:20pm	STAFF
092	W	11:30am - 1:20pm	STAFF		RMTE
093	R	1:30pm - 3:20pm	STAFF
094	W	09:30am - 11:20am	STAFF		RMTE
095	R	3:30pm - 5:20pm	STAFF
096	R	09:30am - 11:20am	STAFF
097	T	11:30am - 1:20pm	STAFF		RMTE
CS 310 - Discrete Computational Structures
Finite and discrete algebraic structures relating to computers; sets, functions, relations. Machine-oriented logic. Combinatorial problems and algorithms. Finite automata and formal language theory. * Prerequisite: MATH 110 or 105, 122, 221, and CS 210 * * Note: It is recommended that students take STAT 160 or STAT 200 in addition to the prerequisite before attempting CS 310. *
001	MWF	2:30pm - 3:20pm	Shakil Khan	12-DEC-22
CS 320 - Introduction to Artificial Intelligence
Foundations and main methods of Artificial Intelligence. Problem characteristics and spaces. Search and optimization techniques with a focus on uninformed and heuristic algorithms. Two player games and constraint satisfaction. Modelling and simulation. Comparison of logic-based, fuzzy, and probabilistic reasoning and knowledge representation methodologies. Machine learning: learning tasks, inductive learning, statistical-based learning, over-fitting, accuracy. *Prerequisite: CS 210, STAT 160 or 200, and MATH 221* Students cannot receive credit for both CS 320 and ENSE 411 (ENSE 496AC).
001	MWF	10:30am - 11:20am	Yiyu Yao	09-DEC-22
CS 330 - Introduction to Operating Systems
Overview of operating systems: functionality, and design issues. Operating system principles: structures, abstractions, APIs, resource allocation, proximity, virtualization. Concurrency: process state, context switches, process communication, synchronization. Scheduling: preemption, schedulers, processes, and threads. Memory management. Security and protection. File systems. User interface. Distributed algorithms: consensus, termination, and fault tolerance. * Prerequisite: CS 210 *
001	MWF	11:30am - 12:20pm	Hanlin Hu	19-DEC-22	RMTE
001	MWF	11:30am - 12:20pm	Hanlin Hu	19-DEC-22	RMTE
095	F	09:30am - 11:20am	STAFF
096	R	1:30pm - 3:20pm	STAFF
097	R	3:30pm - 5:20pm	STAFF
098	F	1:30pm - 3:20pm	STAFF
099	F	3:30pm - 5:20pm	STAFF
CS 335 - Computer Networks
Network architectures and protocols, networked applications, reliable data delivery, routing and forwarding, local area networks, resource allocation, mobility, reliability through redundancy. Security: secure design, defensive programming, threats and attacks, network security, cryptography. * Prerequisite: CS 210 (may be taken concurrently), and STAT 160 or 200 (may be taken concurrently) *
001	TR	7:00pm - 8:15pm	Sultan Ahmed	13-DEC-22
CS 340 - Advanced Data Structures and Algorithm Design
Fundamental algorithms: depth- and breadth-first traversals, pattern matching, and graph algorithms. Algorithmic strategies: brute-force, greedy, divide-and-conquer, backtracking, branch-and-bound, dynamic programming, and randomized. Algorithm analysis, complexity theory, performance evaluation. Parallelism: fundamentals, algorithms, communication. * Prerequisite: CS 210 *
001	F	09:30am - 10:20am	Sandra Zilles	09-DEC-22	BLEND
CS 350 - Programming Language Concepts
Programming language genealogy and design. Imperative, functional, and object-oriented language paradigms. Context-free grammars and syntax trees. Data types, control structures, exception handling, data abstraction, information hiding, and non-determinism. Program representation, translation, and execution. Functional programming: advantages, constructs, closures, and higher-order operations. Parallel programming. * Prerequisite: CS 210 *
001	MWF	4:30pm - 5:20pm	Qian Yu	09-DEC-22
CS 372 - Software Engineering Methodology
Fundamental principles of designing programs and developing large software systems that meet specifications and that are safe, secure, reliable and maintainable. Software process models, software project management, requirements engineering, software design, software construction, software verification and validation, software tools and environments, software evolution, software reliability. * Prerequisite: CS 215 *
001	MW	1:00pm - 2:15pm	Armin Sadreddin	21-DEC-22
CS 375 - Database and Information Retrieval
Information management: concepts and applications. Motivation for database systems. Components of database systems. Data modeling: conceptual, spreadsheet, relational, object-oriented, and semi-structured models. Querying and database query languages. Caching and transaction processing. Other topics include distributed databases, physical database design, and information retrieval systems. * Prerequisite: CS 215 *
001	TR	2:30pm - 3:45pm	David Akinmade	13-DEC-22
CS 408 - Animation Software Design
This course teaches the design and implementation of software for creating animations. Topics include history of animation, technical background, motion control, keyframe-based animation, kinematics, physically based animation, fluid animation, modelling and animating human figures, facial animation, modelling behavior, and special models for animation. *Prerequisite: One of CS 315, CS 320, CS 330, or CS 340*
001	TR	2:30pm - 3:45pm	Alain Maubert Crotte	13-DEC-22	RMTE
001	TR	2:30pm - 3:45pm	Alain Maubert Crotte	13-DEC-22	RMTE
CS 412 - Algorithm Analysis
A formal algorithmic language. Measures of complexity for time and space. Worst-case, average-case, and best-case analysis. Lower and upper bounds of algorithms (techniques include comparison trees, adversary arguments, and reduction). P and NP classes. NP-hardness and NP- completeness. Introduction to parallel computational models and algorithms. * Prerequisite: CS 310 and 340 *
001	MWF	2:30pm - 3:20pm	Mehdi Sadeghilalimi	12-DEC-22
CS 428 - Human Computer Communications
This course stresses the importance of good interfaces and the relationship of user interface design to human-computer interaction. Other topics include: interface quality and methods of evaluation; interface design examples; dimensions of interface variability; dialogue genre; dialogue tools and techniques; user-centered design and task analysis; prototyping and the iterative design cycle; user interface implementation; prototyping tools and environments; I/O devices; basic computer graphics; color and sound. *Prerequisite: CS 215 and CS 280* Note: Students may not receive credit for more than one of CS 305 and CS 428
001	MWF	09:30am - 10:20am	Daryl Hepting	14-DEC-22
CS 435 - Cryptography and Network Security
Classical cryptosystems, data encryption standards, advanced encryption algorithms, public key cryptosystems, digital signatures, IP security, and web security. * Prerequisite: CS 335 *
001	T	7:00pm - 9:45pm	Qian Yu	13-DEC-22
CS 473 - Management Support Systems
Strategic and tactical rewards resulting from the effective use of corporate information systems will be presented. Topics include techniques and tools for developing management support systems. Case studies on development and use of the systems will be discussed. * Prerequisite: CS 372 *
001	TR	5:30pm - 6:45pm	Jingtao Yao	13-DEC-22
CS 476 - Software Development Project
Software development projects following all the phases of the software process. Project planning and scheduling. Surveys on architectural styles, design patterns and components. Semester-long group projects with real-world applications. Projects will be integrative, require evaluation of potential solutions, and require work on a larger scale than typical course projects. *Prerequisite: CS 372*
001		-	Samira Sadaoui-Mouhoub	22-DEC-22	BLEND
001	T	10:00am - 11:15am	Samira Sadaoui-Mouhoub	22-DEC-22	BLEND
CS 498 - Honours Oral
All honours computer science students are required to register for this course in the semester in which they plan to do their oral examination. The course will be graded C (credit) or N (no credit).
001		-	Malek Mouhoub
CS 499 - Honours Seminar
This course is to be taken by all honours computer science students in both semesters of their fourth year. The student is required to attend all seminars and, in addition, to present a topic that will be determined in consultation with a faculty member in Computer Science.
001	MWF	3:30pm - 4:20pm	Howard Hamilton
002	MWF	3:30pm - 4:20pm	Howard Hamilton