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, (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 |
|---|---|---|---|
|
Brad Bart |
Jan 10 – Apr 11, 2022: Wed, 11:30 a.m.–12:20 p.m.
Jan 10 – Apr 11, 2022: Fri, 10:30 a.m.–12:20 p.m. |
Burnaby Burnaby |
|
|
Brad Bart |
Jan 10 – Apr 11, 2022: Wed, 3:30–4:20 p.m.
Jan 10 – Apr 11, 2022: Fri, 2:30–4:20 p.m. |
Burnaby Burnaby |