Fall Term 2023 (1850)
CMPUT 204 - Algorithms I
★ 3 (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; one of MATH 100, 113, 114, 117, 134, 144, 154, or SCI 100.
LECTURE A1 (81994)
2023-09-05 - 2023-12-08
MWF 10:00 - 10:50 (T LB-001)
CMPUT 605 - Topics in Computing Science
★ 3 (fi 6)(EITHER, 3-0-0)
LECTURE A08 (89642)