★ 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 B1 (44489)
2023-01-05 - 2023-04-12
MWF 10:00 - 10:50 (C E1-60)
★ 3 (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 MATH 125.
LECTURE B1 (44762)
2023-01-05 - 2023-04-12
TH 09:30 - 10:50 (CCIS 1-140)