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 141, 151, 235 or 265 or SCI 151; one of MATH 225, 227, 228; or consent of the instructor.
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
LECTURE A1
(84228) |
103 |
2023-09-05 - 2023-12-08 (TR)
11:00 - 12:20
MEC 2-1
Final Exam: 2023-12-20
14:00 - 17:00
MEC 2-1
|
Primary Instructor: Ryan Hayward
|
|
LECTURE EA1
(84229) |
22 |
2023-09-05 - 2023-12-08 (TR)
11:00 - 12:20
MEC 2-1
Final Exam: 2023-12-20
14:00 - 17:00
MEC 2-1
|
Primary Instructor: Ryan Hayward
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
SEMINAR EF1
(84231) |
22 |
2023-09-05 - 2023-12-08 (W)
15:00 - 15:50
CCIS L1-140
|
|
|
SEMINAR F1
(84230) |
103 |
2023-09-05 - 2023-12-08 (W)
15:00 - 15:50
CCIS L1-140
|
|