Xiaoqi Tan, PhD

Assistant Professor, Faculty of Science - Computing Science
Directory

Winter Term 2023 (1820)

CMPUT 204 - Algorithms I

★ 3 (fi 6)(EITHER, 3-1S-0)

The first of two courses on algorithm design and analysis, with emphasis on fundamentals of searching, sorting, and graph algorithms. Examples include divide and conquer, dynamic programming, greedy methods, backtracking, and local search methods, together with analysis techniques to estimate program efficiency. Prerequisites: CMPUT 175 or 275 and CMPUT 272; one of MATH 100, 113, 114, 117, 134, 144, 154, or SCI 100.

LECTURE B2 (41246)

2023-01-05 - 2023-04-12
MWF 11:00 - 11:50 (C E1-60)



CMPUT 499 - Topics in Computing Science

★ 3 (fi 6)(VAR, VARIABLE)

This topics course is designed for a one on one individual study course between a student and an instructor. Prerequisites are determined by the instructor in the course outline. See Note (3) above.

LECTURE B07 (50302)

LECTURE B08 (50303)