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 David Mitchell
Mo, We, Fr 9:30 AM – 10:20 AM
EDB 7618, Burnaby