Fall Term 2024 (1890)
CMPUT 204 - Algorithms I
3 units (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; and one of MATH 100, 114, 117, 134, 144, or 154.
LECTURE A1 (47736)
2024-09-03 - 2024-12-09
MWF 10:00 - 10:50
CMPUT 676 - Topics in Computing Science
3 units (fi 6)(EITHER, 3-0-0)
LECTURE A2 (55192)
2024-09-03 - 2024-12-09
MW 12:00 - 13:20
Winter Term 2025 (1900)
CMPUT 204 - Algorithms I
3 units (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; and one of MATH 100, 114, 117, 134, 144, or 154.
LECTURE B2 (70814)
2025-01-06 - 2025-04-09
MWF 11:00 - 11:50