i Please note:
To view the current calendar, go to
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 |
|---|---|---|---|
|
Pavol Hell |
Sep 2 – Dec 1, 2014: Tue, 2:30–4:20 p.m.
Sep 2 – Dec 1, 2014: Thu, 2:30–3:20 p.m. |
Burnaby Burnaby |
|
|
Joseph Peters |
Sep 2 – Dec 1, 2014: Mon, Wed, 2:30–3:20 p.m.
Sep 2 – Dec 1, 2014: Fri, 2:30–3:20 p.m. |
Surrey Surrey |