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.

CMPUT 325 - Non-Procedural Programming Languages

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

A study of the theory, run-time structure, and implementation of selected non-procedural programming languages. Languages will be selected from the domains of functional, and logic-based languages. Prerequisites: CMPUT 201 and 204, or 275; one of CMPUT 229, E E 380, or ECE 212; and one of MATH 102, 125, or 127.

CMPUT 499 - Topics in Computing Science

3 units (fi 6)(VAR, VARIABLE)

This topics course is designed for a one on one individual study course between a student and an instructor. Prerequisites are determined by the instructor in the course outline. See Note (3) above.