Computer Science (CSC) Courses>Combinatorial Algorithms

CSC428A - Combinatorial Algorithms

Description

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.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Prerequisites

  • Complete all of the following
    • Complete 1 of the following
      • Earn a minimum grade of B+ in each of the following:
        • CSC226 - Algorithms and Data Structures II (1.5)
      • Complete all of the following
        • Earn a minimum grade of B+ in each of the following:
          • CSC225 - Algorithms and Data Structures I (1.5)
        • Earn a minimum grade of B in each of the following:
          • MATH222 - Discrete and Combinatorial Mathematics (1.5)
    • minimum third-year standing.

Course offered by

Department of Computer Science

Course schedules

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

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.