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 |
|---|---|---|---|
|
David Mitchell |
Jan 6 – Apr 13, 2015: Mon, Wed, Fri, 10:30–11:20 a.m.
|
Burnaby |
|
| D101 |
Jan 6 – Apr 13, 2015: Thu, 9:30–10:20 a.m.
|
Burnaby |
|
| D102 |
Jan 6 – Apr 13, 2015: Thu, 10:30–11:20 a.m.
|
Burnaby |
|
| D103 |
Jan 6 – Apr 13, 2015: Thu, 11:30 a.m.–12:20 p.m.
|
Burnaby |
|
| D104 |
Jan 6 – Apr 13, 2015: Thu, 12:30–1:20 p.m.
|
Burnaby |
|
| D105 |
Jan 6 – Apr 13, 2015: Thu, 1:30–2:20 p.m.
|
Burnaby |
|
| D106 |
Jan 6 – Apr 13, 2015: Thu, 2:30–3:20 p.m.
|
Burnaby |
|
| D107 |
Jan 6 – Apr 13, 2015: Thu, 3:30–4:20 p.m.
|
Burnaby |