CMPT 280
Intermediate Data Structures and Algorithms
Formal abstract data types; tree representations and searching: ordered trees, balanced trees, simple spatial trees; graph representations and searching: path algorithms, DFS, BFS, backtracking, and sorting algorithms.
Prerequisites & course information
Weekly hours: 3 Lecture hours and 1.5 Tutorial hours Prerequisite(s): CMPT 270. Note: Students with credit for CMPT 250 may not take this course for credit. Costs in addition to tuition apply to this course.
Sources
- Course catalogue ↗2026-2027