Close

CMPT 280: Intermediate Data Structures and Algorithms

Description
Formal abstract data types; tree representations and searching: ordered trees, balanced trees, simple spacial trees; graph representations and searching: path algorithms, dfs, bfs, backtracking, and sorting algorithms.
Credit units
3
Term description
2(3L-1.5T)
College
Arts and Science
Department
Computer Science
Formerly
Second half of CMPT 250.6.
Prerequisite(s)
CMPT 270.
Note:
Students with credit for CMPT 250 may not take this course for credit.