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.
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
LECTURE B1
(13688) |
290 |
2024-01-08 - 2024-04-12 (MWF)
10:00 - 10:50
CCIS L2-190
|
Primary Instructor: Jia-Huai You
|
|
LECTURE B2
(10924) |
290 |
2024-01-08 - 2024-04-12 (MWF)
11:00 - 11:50
CCIS L2-190
|
Primary Instructor: Martin Mueller
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
SEMINAR J1
(13689) |
194 |
2024-01-08 - 2024-04-12 (M)
16:00 - 16:50
ETLC E1-003
|
|
|
SEMINAR J2
(13690) |
181 |
2024-01-08 - 2024-04-12 (T)
08:00 - 08:50
ETLC E1-007
|
|
|
SEMINAR J3
(15325) |
195 |
2024-01-08 - 2024-04-12 (T)
17:00 - 17:50
ETLC E1-007
|
|
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 | Instructor(s) |
|---|---|---|---|
|
LECTURE A1
(47736) |
350 |
2024-09-03 - 2024-12-09 (MWF)
10:00 - 10:50
T L-11
|
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
SEMINAR F01
(47737) |
117 |
2024-09-03 - 2024-12-09 (M)
17:00 - 17:50
CSC B-02
|
|
|
SEMINAR F02
(47738) |
117 |
2024-09-03 - 2024-12-09 (T)
12:30 - 13:20
CSC B-02
|
|
|
SEMINAR F03
(47739) |
116 |
2024-09-03 - 2024-12-09 (W)
11:00 - 11:50
CSC B-02
|
|
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 | Instructor(s) |
|---|---|---|---|
|
LECTURE B1
(73208) |
305 |
2025-01-06 - 2025-04-09 (MWF)
10:00 - 10:50
T LB-001
|
|
|
LECTURE B2
(70814) |
305 |
2025-01-06 - 2025-04-09 (MWF)
11:00 - 11:50
T LB-001
|
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
SEMINAR J01
(73209) |
203 |
2025-01-06 - 2025-04-09 (M)
16:00 - 16:50
ETLC E1-013
|
|
|
SEMINAR J02
(73210) |
203 |
2025-01-06 - 2025-04-09 (T)
08:00 - 08:50
ETLC E1-017
|
|
|
SEMINAR J03
(74731) |
204 |
2025-01-06 - 2025-04-09 (T)
17:00 - 17:50
ETLC E1-017
|
|