CMPT 280

Intermediate Data Structures and Algorithms

Lec 02 and Tut T02 selected

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.

Sections

Lecture, pick one

Lec 02

Mon, Wed, Fri 14:30-15:20

Mon, Wed, Fri14:30-15:20Arts Building 13321987

Lec 04

Mon, Wed, Fri 8:30-9:20

Mon, Wed, Fri8:30-9:20Physics Building 10328906

Tutorial, pick one

Tut T02

Fri 10:30-11:50

Fri10:30-11:50Arts Building 14621988

Tut T04

Tue 16:00-17:20

Tue16:00-17:20Thorvaldson Building 12421989

Tut T06

Wed 9:30-10:50

Wed9:30-10:50Thorvaldson Building 11028944

Syllabus

Have the syllabus for CMPT 280? Share it and everyone gets the grading, textbooks and rules.