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

Fall Term 2023

Lectures

Section Capacity Class times Instructor(s)
LECTURE A1
(81994)
277
2023-09-05 - 2023-12-08 (MWF)
10:00 - 10:50
T LB-001

Final Exam:
2023-12-12
14:00 - 17:00
T LB-001
Primary Instructor: Xiaoqi Tan

Seminars

Section Capacity Class times Instructor(s)
SEMINAR F1
(81995)
91
2023-09-05 - 2023-12-08 (M)
17:00 - 17:50
CSC B-10
SEMINAR F2
(81996)
92
2023-09-05 - 2023-12-08 (T)
12:30 - 13:20
CSC B-10
SEMINAR F3
(81997)
94
2023-09-05 - 2023-12-08 (W)
11:00 - 11:50
CSC B-10

Winter Term 2024

Lectures

Section Capacity Class times Instructor(s)
LECTURE B1
(13688)
290
2024-01-08 - 2024-04-12 (MWF)
10:00 - 10:50
CCIS L2-190
Primary Instructor: Jia-Huai You
LECTURE B2
(10924)
290
2024-01-08 - 2024-04-12 (MWF)
11:00 - 11:50
CCIS L2-190
Primary Instructor: Martin Mueller

Seminars

Section Capacity Class times Instructor(s)
SEMINAR J1
(13689)
193
2024-01-08 - 2024-04-12 (M)
16:00 - 16:50
ETLC E1-003
SEMINAR J2
(13690)
183
2024-01-08 - 2024-04-12 (T)
08:00 - 08:50
ETLC E1-007
SEMINAR J3
(15325)
194
2024-01-08 - 2024-04-12 (T)
17:00 - 17:50
ETLC E1-007