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.
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE A1
(49816) |
115 |
2024-09-03 - 2024-12-09 (TR)
11:00 - 12:20
|
|
|
LECTURE EA1
(49817) |
8 |
2024-09-03 - 2024-12-09 (TR)
11:00 - 12:20
|
|
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
SEMINAR EF01
(49819) |
8 |
2024-09-03 - 2024-12-09 (W)
15:00 - 15:50
|
|
|
SEMINAR F01
(49818) |
115 |
2024-09-03 - 2024-12-09 (W)
15:00 - 15:50
|
|