CMPUT 204 - Algorithms I

3 units (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; and one of MATH 100, 114, 117, 134, 144, or 154.

No syllabi

Fall Term 2025

Lectures

Section Capacity Class times Login to view Instructor(s) and Location
LECTURE A1
(51630)
350
2025-09-02 - 2025-12-08 (MWF)
10:00 - 10:50
LECTURE A2
(57835)
186
2025-09-02 - 2025-12-08 (MWF)
11:00 - 11:50

Seminars

Section Capacity Class times Login to view Instructor(s) and Location
SEMINAR F01
(51631)
124
2025-09-02 - 2025-12-08 (M)
17:00 - 17:50
SEMINAR F02
(51632)
124
2025-09-02 - 2025-12-08 (T)
12:30 - 13:20
SEMINAR F03
(51633)
124
2025-09-02 - 2025-12-08 (W)
11:00 - 11:50

Winter Term 2026

Lectures

Section Capacity Class times Login to view Instructor(s) and Location
LECTURE B1
(82902)
192
2026-01-05 - 2026-04-10 (MWF)
10:00 - 10:50
LECTURE B2
(80699)
192
2026-01-05 - 2026-04-10 (MWF)
11:00 - 11:50
LECTURE B3
(87850)
192
2026-01-05 - 2026-04-10 (MWF)
13:00 - 13:50

Seminars

Section Capacity Class times Login to view Instructor(s) and Location
SEMINAR J01
(82903)
203
2026-01-05 - 2026-04-10 (M)
16:00 - 16:50
SEMINAR J02
(82904)
203
2026-01-05 - 2026-04-10 (T)
08:00 - 08:50
SEMINAR J03
(84347)
204
2026-01-05 - 2026-04-10 (T)
17:00 - 17:50