CMPUT 497 - Topics in Computing Science

3 units (fi 6)(VAR, VARIABLE)

This topics course is designed for new course offerings that may be offered in a given term. Prerequisites are determined by the instructor in the course outline. See Note (3) above.

CMPUT 641 - Advanced Computer Networks

3 units (fi 6)(EITHER, 3-0-0)

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.