CMPUT 204 - Algorithms I

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

Faculty of Science

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.

No syllabi

Winter Term 2023

Lectures

Section Capacity Dates + Times Instructor(s)
LECTURE B1
(44489)
250
2023-01-05 - 2023-04-12
MWF 10:00 - 10:50 (C E1-60)
Primary Instructor: Jia-Huai You
LECTURE B2
(41246)
250
2023-01-05 - 2023-04-12
MWF 11:00 - 11:50 (C E1-60)
Primary Instructor: Xiaoqi Tan

Seminars

Section Capacity Dates + Times Instructor(s)
SEMINAR J1
(44490)
166
2023-01-05 - 2023-04-12
M 16:00 - 16:50 (CCIS L1-140)
SEMINAR J2
(44491)
167
2023-01-05 - 2023-04-12
T 08:00 - 08:50 (CCIS L1-140)
SEMINAR J3
(46447)
167
2023-01-05 - 2023-04-12
T 17:00 - 17:50 (CCIS L1-140)