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.

Winter Term 2021

Lectures

LECTURE B1 (95918)
2021-01-04 - 2021-04-09
MWF 10:00 - 10:50 (TBD)

Primary Instructor: Jia-Huai You
LECTURE B2 (44291)
2021-01-04 - 2021-04-09
MWF 11:00 - 11:50 (TBD)

Primary Instructor: Ehab Elmallah

Seminars

SEMINAR J1 (95920)
2021-01-04 - 2021-04-09
M 16:00 - 16:50 (TBD)

SEMINAR J2 (95922)
2021-01-04 - 2021-04-09
T 08:00 - 08:50 (TBD)

Fall Term 2021

Lectures

LECTURE A1 (45022)
2021-09-01 - 2021-12-07
MWF 10:00 - 10:50 (TBD)

Seminars

SEMINAR F1 (45024)
2021-09-01 - 2021-12-07
M 17:00 - 17:50 (TBD)

SEMINAR F2 (45026)
2021-09-01 - 2021-12-07
T 12:30 - 13:20 (TBD)

SEMINAR F3 (45028)
2021-09-01 - 2021-12-07
W 11:00 - 11:50 (TBD)

Winter Term 2022

Lectures

LECTURE B1 (71916)
2022-01-05 - 2022-04-08
MWF 10:00 - 10:50 (TBD)

LECTURE B2 (63606)
2022-01-05 - 2022-04-08
MWF 11:00 - 11:50 (TBD)

Seminars

SEMINAR J1 (71918)
2022-01-05 - 2022-04-08
M 16:00 - 16:50 (TBD)

SEMINAR J2 (71920)
2022-01-05 - 2022-04-08
T 08:00 - 08:50 (TBD)