Credit units: 3
Offered: Term 2 only
Weekly hours: 3 Lecture hours and 1.5 Tutorial hours
College: Arts and Science
Department: Computer Science
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.
Upcoming class offerings
Examples of current or recently-offered class syllabus material can be found on the Open CourseWare website.
The syllabus is a public document that provides detail about a class, such as the schedule of activities, learning outcomes, and weighting of assignments and examinations. Please note that the examples provided in Open CourseWare do not represent a complete set of current or previous syllabus material. Rather, they are presented solely for the purpose of indicating what may be required for a given class.
For more information about syllabi, visit the Academic Courses Policy.