Please note:
To view the current Academic Calendar, go to www.sfu.ca/students/calendar.html.
Data Structures and Algorithms CMPT 307 (3)
Design and analysis of efficient data structures and algorithms. General techniques for building and analyzing algorithms (greedy, divide & conquer, dynamic programming, network flows). Introduction to NP-completeness. Prerequisite: CMPT 225, (MACM 201 or CMPT 210), (MATH 150 or MATH 151), and (MATH 232 or MATH 240), all with a minimum grade of C-. MATH 154 or MATH 157 with a grade of at least B+ may be substituted for MATH 150 or MATH 151.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
| D100 |
Andrei Bulatov |
Sep 4 – Dec 3, 2024: Mon, Wed, Fri, 12:30–1:20 p.m.
Oct 15, 2024: Tue, 12:30–1:20 p.m. |
Burnaby Burnaby |
| D200 |
David Mitchell |
Sep 4 – Oct 11, 2024: Tue, 8:30–10:20 a.m.
Oct 16 – Dec 3, 2024: Tue, 8:30–10:20 a.m. Sep 4 – Dec 3, 2024: Fri, 8:30–9:20 a.m. |
Burnaby Burnaby Burnaby |