CSC 528

Combinatorial Algorithms

Units: 1.5

Focuses on the interfaces between combinatorics and Computer Science. Algorithms and data structures that are used to manipulate, generate, and randomly select combinatorial objects are studied. Such objects include sets, permutations, combinations, trees, graphs. Methods for analyzing combinatorial algorithms such as recurrence relations, asymptotics, and amortized complexity are presented.

Graduate course in the Computer Science program offered by the Faculty of Graduate Studies.

Summer 2019 Fall 2019 Spring 2020

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Before these dates the class schedule will show "No classes were found that meet your search criteria". If this message is shown after these dates, the course is not scheduled for the selected term.