Credit units: 3
Offered: Either Term 1 or Term 2
Weekly hours: 3 Lecture hours
College: Arts and Science
Department: Computer Science
A continuation of the algorithms part of CMPT 360. Some of the algorithm techniques include: augmenting algorithms for network flows, matching and graph connectivity, geometric algorithms for nearest neighbour, intersection problems, and convex hull, parallel and distributed algorithms.
Formerly: CMPT 416.
Prerequisite(s): CMPT 360.
Note: Students with credit for CMPT 416 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.