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.
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE B1
(82902) |
192 |
2026-01-05 - 2026-04-10 (MWF)
10:00 - 10:50
|
|
|
LECTURE B2
(80699) |
192 |
2026-01-05 - 2026-04-10 (MWF)
11:00 - 11:50
|
|
|
LECTURE B3
(87850) |
192 |
2026-01-05 - 2026-04-10 (MWF)
13:00 - 13:50
|
|
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
SEMINAR J01
(82903) |
203 |
2026-01-05 - 2026-04-10 (M)
16:00 - 16:50
|
|
|
SEMINAR J02
(82904) |
203 |
2026-01-05 - 2026-04-10 (T)
08:00 - 08:50
|
|
|
SEMINAR J03
(84347) |
155 |
2026-01-05 - 2026-04-10 (T)
17:00 - 17:50
|
|