Course Timetable

Section	Day	Time	Instructor	Exam Date	Delivery
2021 Fall 2022 Winter
CS 809 - Interactive Entertainment SW
This course surveys current research on the design and implementation of interactive entertainment software, including computer games. Topics include: interactivity, principles of interactive entertainment, hardware platforms, current software development tools and languages, game loop, design of virtual worlds and virtual characters, real-time requirements, incorporating multimedia resources, aesthetics.
001	MWF	10:30am - 11:20am	Howard Hamilton	10-DEC-21	RLDS
CS 811 - Theory of Computing
Study of fundamental concepts of computer science from the theoretical point of view; basic concepts of computational complexity theory, algorithm analysis and their relation to the set of problems which can be programmed; "good" algorithm design. Prior to registering in this course, students should have a background in introductory compiler design, or algorithm analysis comparable to the senior undergraduate level.
001	MWF	1:30pm - 2:20pm	Daniel Page	17-DEC-21	RLDS
CS 828 - Human Computer Communication
Theory and practice related to the design and implementation of usable software and easy-to-learn interfaces. Specific topics will include user-centered design and task analysis; prototyping and the iterative design cycle; interface design and methods of evaluation.
001	MWF	12:30pm - 1:20pm	Daryl Hepting	22-DEC-21
CS 831 - Knowledge Discov in Databases
Knowledge discovery from databases in the nontrivial extraction of implicit, previously unknown, and potentially useful information from databases. This course focuses on data sources, extraction techniques, efficiency concerns, and measures of novelty and usefulness. Prior to registering for this course, students should have a background in database and information retrieval, and artificial intelligence comparable to the senior undergraduate level.
001	MW	09:00am - 10:15am	Lisa Fan	13-DEC-21	RLDS
CS 834 - Fundamentals of Computer Systems Security
This course presents the objectives and the fundamentals of computer and network system security: confidentiality, integrity, availability, authentication, and authorization. Common security concepts are detailed, such as cryptography, symmetric/asymmetric encryption, digital signature, certificate authority, hashing, communication protocol security, and audit. Mathematical foundations and applications of these methods will be explained.
001	R	7:00pm - 9:45pm	Qian Yu	16-DEC-21	RLDS
CS 838 - Uncertain Reasoning in Al
Advances in using uncertain knowledge to make decisions rationally and effectively (for diagnosis, trouble shooting, robot navigation, etc.). Focus on probabilistic approach and graphical modelling to aid inference. Topics: criteria fo uncertainty management, comparison of schemes, Bayesian/Markov networks, influence diagrams, chain graphs, inference algorithms, elicitation and learning of belief networks. * Note: Prior to registering for this course, students should have a background in discrete computational structures, artificial intelligence and statistical methods comparable to the senior undergraduate level. *
001	TR	11:30am - 12:45pm	Cortney Butz
CS 890AC - DataAnalysis from the Internet
Data Analysis from the Internet: Language, indexing and classification; extracting and abstracting by computer; stylistic analysis, statistical models and the entropy of English; hidden Markov models; probablistic context-free grammars; data analysis via data mining and rule induction; ELEM2.
001	MW	5:30pm - 6:45pm	Trevor Tomesh	13-DEC-21	RLDS
CS 890BA - Secure Computers and Networks
Secure Computers and Networks: Fundamentals of Computer Security, Cryptography and Security Standards, Fire walls and Web Security and Case studies.
001		-	Habib Louafi
CS 890BN - Cryptography and Data Security
Mathematical background of Cryptography, cryptographic protocols and techniques, symmetric-key cryptography algorithms and securtiy analysis. One-way hash functions and public-key algorithms. Examples of cryptographic systems.
001	T	5:30pm - 8:15pm	Qian Yu		RLDS
CS 890CO - Heuristic Algorithms in Optim
In this course, we will study state-of-the-art heuristic algorithms for finding approximation solutions, including simulated annealing, genetic algorithms, ant colony algorithms, tabu search and others.
001	MWF	12:30pm - 1:20pm	Malek Mouhoub
CS 890EM - Topics in Algorithm Analysis
This course provides an intensive study of one or more topics related to Algorithmic Analysis. Potential topics include formal algorithmic languages, measures of complexity, type of analysis, bounds of algorithms, classes of problems, and parallel computational models and algorithms.
001	MWF	11:30am - 12:20pm	Boting Yang	20-DEC-21	RLDS
CS 900 - Computer Science Graduate Seminar
CS Graduate students must complete two semesters of CS 900, with the exception of MSc Course Route students, who must complete one semester of CS 900. When enrolled in CS 900, a student must make one presentation and attend all presentations. In the first semester of CS 900, the student will choose a Computer Science topic within their research area. In the second semester of CS 900 (if required), the student will choose a topic within their own research.
001	MWF	3:30pm - 4:20pm	Alireza Manashty		RLDS
CS 901 - Research
Thesis research.
001		-	Cortney Butz
003		-	Lisa Fan
004		-	Howard Hamilton
005		-	Daryl Hepting
008		-	Malek Mouhoub
010		-	Samira Sadaoui-Mouhoub
012		-	Boting Yang
013		-	Xue-Dong Yang
014		-	Jingtao Yao
015		-	Yiyu Yao
019		-	David Gerhard
022		-	Sandra Zilles
023		-	Orland Hoeber
024		-	Habib Louafi
025		-	Alireza Manashty
026		-	Nashid Shahriar
CS 902 - Project Research
A supervisor approved project requiring an in-depth student investigation of a CS problem.
001		-	Cortney Butz
004		-	Howard Hamilton
005		-	Daryl Hepting
008		-	Malek Mouhoub
010		-	Samira Sadaoui-Mouhoub
012		-	Boting Yang
013		-	Xue-Dong Yang
014		-	Jingtao Yao
015		-	Yiyu Yao
019		-	David Gerhard
022		-	Sandra Zilles
023		-	Orland Hoeber
024		-	Habib Louafi
025		-	Alireza Manashty