Data Structures and Algorithms CMPT 307 (3)
Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Joseph Peters |
Sep 6 – Dec 5, 2016: Tue, 11:30 a.m.–1:20 p.m.
Sep 6 – Dec 5, 2016: Thu, 11:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
|
|
Kay C Wiese |
Sep 6 – Dec 5, 2016: Wed, 1:30–2:20 p.m.
Sep 6 – Dec 5, 2016: Fri, 12:30–2:20 p.m. |
Surrey Surrey |
|
|
Xian Qiu |
Sep 6 – Dec 5, 2016: Mon, Wed, Fri, 3:30–4:20 p.m.
|
Burnaby |