Subject: Computer Science
Credit units: 3
Offered: Either Term 1 or Term 2
Weekly hours: 3 Lecture hours
College: Arts and Science
Department: Computer Science

Description

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

For full details about upcoming courses, refer to the class search tool or, if you are a current student, the registration channel in PAWS.

Syllabi

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 below 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.

It is recommended that students also have online access to syllabi prior to the beginning of the class. After submission to the department head, or dean in non-departmentalized colleges, syllabi should be posted on Blackboard and/or publically accessible departmental or other websites. Instructors who post their syllabus on publically accessible websites may wish to redact certain information that is not related to the core instruction of the class (e.g. personal contact information, names and contact information for teaching assistants, material protected under copyright, etc.).

Once an instructor has made their syllabus publicly available on Blackboard, it will appear below. For more information about syllabi, visit the Academic Courses Policy.

For more information about syllabi, visit the Academic Courses Policy.

Loading...

Resources