i Please note:
To view the current calendar, go to
Data Structures and Algorithms CMPT 307 (3)
Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.
For calendar technical problems or errors, contact calendar-sfu@sfu.ca | Calendar Changes and Corrections