CSC 428A

Combinatorial Algorithms

Units: 1.5

Hours: 3-0

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

Prerequisites:

  • Either CSC 226 with a minimum grade of B+, or CSC 225 with a minimum grade of B+ and MATH 222 with a minimum grade of B; and
  • minimum third-year standing.

Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.

Schedules:
Summer Fall Spring

Note that not all courses are offered in every term. If a course is not offered, the schedule page will alert you that "No classes were found that meet your search criteria."