Exploring term Fall 2023 Change

    CSC428A

    Combinatorial Algorithms

    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.

    Lecture: 3h
    Lab: 0h
    Tutorial: 0h
    Credits: 1.5