CMPUT 204 - Algorithms I

★ 3 (fi 6) (either term, 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: one of CMPUT 115 or 175 and CMPUT 272; one of MATH 113, 114, 117 or 144 or SCI 100.