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 one of CMPT 125, 126 or 128; or CMPT 128 and approval as a Biomedical Engineering Major. Students with credit for CMPT 201 may not take this course for further credit. Quantitative.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
John Edgar |
May 11 – Aug 10, 2015: Mon, 12:30–2:20 p.m.
May 11 – Aug 10, 2015: Wed, 12:30–1:20 p.m. |
Burnaby Burnaby |
|
| D101 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Tue, 11:30 a.m.–12:20 p.m.
|
Burnaby |
| D102 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Tue, 12:30–1:20 p.m.
|
Burnaby |
| D103 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Tue, 1:30–2:20 p.m.
|
Burnaby |
| D104 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
| D105 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Thu, 12:30–1:20 p.m.
|
Burnaby |
| D106 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Thu, 1:30–2:20 p.m.
|
Burnaby |
| D107 |
Geoffrey Tien |
May 11 – Aug 10, 2015: Thu, 2:30–3:20 p.m.
|
Burnaby |