Please note:
To view the Fall 2026 Academic Calendar, go to www.sfu.ca/students/calendar/2026/fall.
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 |
Valentine Kabanets |
Jan 5 – Apr 12, 2027: Mon, 10:30–11:20 a.m.
Jan 5 – Apr 12, 2027: Thu, 10:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
| E100 |
Valentine Kabanets |
Jan 5 – Apr 12, 2027: Mon, 4:30–5:20 p.m.
Jan 5 – Apr 12, 2027: Thu, 4:30–6:20 p.m. |
Burnaby Burnaby |