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 (CMPT 125 and 127), CMPT 129 or CMPT 135)) or (ENSC 251 and ENSC 252). Quantitative.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Anne Lavergne |
May 8 – Aug 4, 2017: Mon, Wed, Fri, 12:30–1:20 p.m.
|
Burnaby |
|
| D101 |
May 8 – Aug 4, 2017: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
| D102 |
May 8 – Aug 4, 2017: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
| D103 |
May 8 – Aug 4, 2017: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D104 |
May 8 – Aug 4, 2017: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D105 |
May 8 – Aug 4, 2017: Thu, 12:30–1:20 p.m.
|
Burnaby |
|
| D106 |
May 8 – Aug 4, 2017: Thu, 12:30–1:20 p.m.
|
Burnaby |
|
| D107 |
May 8 – Aug 4, 2017: Thu, 1:30–2:20 p.m.
|
Burnaby |
|
| D108 |
May 8 – Aug 4, 2017: Thu, 1:30–2:20 p.m.
|
Burnaby |