Intermediate Data Structures and Algorithms (CMPT 280.3)

Recent/Current Offerings

Syllabus / Public content Section Term Instructor
CMPT 280 02 January 2017 Mark Eramian (primary instructor)
 
CMPT 280 02 July 2016 Cyril Coupal (primary instructor)
 
CMPT 280 02 January 2016 Mark Eramian (primary instructor)

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.

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.

Resources and Supports for CMPT 280

U of S Bookstore Textbook Search
Library Reserves Search
Hire a Tutor Search