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 |
|---|---|---|---|
|
Qianping Gu |
Jan 8 鈥� Apr 12, 2024: Mon, Wed, Fri, 1:30鈥�2:20 p.m.
|
Burnaby |
|
|
Jan 8 鈥� Apr 12, 2024: Tue, 5:30鈥�7:20 p.m.
Jan 8 鈥� Apr 12, 2024: Thu, 5:30鈥�6:20 p.m. |
Surrey Surrey |
||
|
Kay C Wiese |
Jan 8 鈥� Apr 12, 2024: Mon, 2:30鈥�4:20 p.m.
Jan 8 鈥� Apr 12, 2024: Wed, 2:30鈥�3:20 p.m. |
Burnaby Burnaby |