CMPUT 204 - Algorithms I

Course Career Undergraduate
Units 3
Approved Hours 3-1S-0
Fee index 6
Faculty Science
Department Computing Science
Typically Offered either term

Description
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.