Data Structures and Programming CMPT 225 (3)
Introduction to a variety of practical and important data structures and methods for implementation and for experimental and analytical evaluation. Topics include: stacks, queues and lists; search trees; hash tables and algorithms; efficient sorting; object-oriented programming; time and space efficiency analysis; and experimental evaluation. Prerequisite: (MACM 101 and either (CMPT 125 and 127) or CMPT 135) or (ENSC 251 and ENSC 252). Quantitative.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Anne Lavergne |
May 9 – Aug 8, 2016: Mon, 12:30–2:20 p.m.
May 9 – Aug 8, 2016: Wed, 12:30–1:20 p.m. |
Burnaby Burnaby |
|
| D101 |
Anne Lavergne |
May 9 – Aug 8, 2016: Tue, 11:30 a.m.–12:20 p.m.
|
Burnaby |
| D102 |
Anne Lavergne |
May 9 – Aug 8, 2016: Tue, 12:30–1:20 p.m.
|
Burnaby |
| D103 |
Anne Lavergne |
May 9 – Aug 8, 2016: Tue, 1:30–2:20 p.m.
|
Burnaby |
| D104 |
Anne Lavergne |
May 9 – Aug 8, 2016: Thu, 10:30–11:20 a.m.
|
Burnaby |
| D105 |
Anne Lavergne |
May 9 – Aug 8, 2016: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
| D106 |
Anne Lavergne |
May 9 – Aug 8, 2016: Thu, 12:30–1:20 p.m.
|
Burnaby |
| D107 |
Anne Lavergne |
May 9 – Aug 8, 2016: Thu, 1:30–2:20 p.m.
|
Burnaby |