Fall Term 2025 (1930)
CMPUT 303 - Algorithmics in Practice
3 units (fi 6)(EITHER, 3-0-0)
This course is focused on algorithmic problems, where a solution involves properly understanding a written description, designing an efficient algorithm to solve the problem, and then correctly implementing the solution. Students will use previous knowledge in algorithms, data structures, and mathematical reasoning to solve problems in addition to learning new algorithms and data structures. Lectures are shared with CMPUT 403. Credit cannot be obtained for both CMPUT 303 and CMPUT 403. Prerequisites: CMPUT 201 or 275, and 204.
LECTURE A1 (57845)
2025-09-02 - 2025-12-08
TR 09:30 - 10:50
CMPUT 304 - Algorithms II
3 units (fi 6)(EITHER, 3-1S-0)
The second course of a two-course sequence on algorithm design. Emphasis on principles of algorithm design. Categories of algorithms such as divide-and-conquer, greedy algorithms, dynamic programming; analysis of algorithms; limits of algorithm design; NP-completeness; heuristic algorithms. Prerequisites: CMPUT 204; one of STAT 151, 161, 181, 235, 265, SCI 151, or MATH 181; and one of MATH 225, 227, or 228.
LECTURE A1 (53548)
2025-09-02 - 2025-12-08
TR 11:00 - 12:20
LECTURE EA1 (53549)
2025-09-02 - 2025-12-08
TR 11:00 - 12:20
CMPUT 403 - Algorithmics in Competitive Programming
3 units (fi 6)(EITHER, 3-1S-0)
This course is focused on algorithmic problems that can be solved within at most several hours by well-prepared people, where a solution involves properly understanding a written description, designing an efficient algorithm to solve the problem, and then correctly implementing the solution. Students will use algorithms, data structures, and mathematical reasoning to solve problems. Lectures are shared with CMPUT 303. CMPUT 403 covers additional material relevant to advanced programming contests. Credit cannot be obtained for both CMPUT 303 and CMPUT 403. Prerequisites: CMPUT 201 or 275, and 204, and any 300-level Computing Science course.
LECTURE A1 (57846)
2025-09-02 - 2025-12-08
TR 09:30 - 10:50