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.
Note: Credit will be granted for only one of 428A and a topics course with similar content.
Prerequisites: A minimum grade of B+ in 225, a minimum grade of B+ in MATH 222 and third- or fourth-year standing.
Undergraduate course in Computer Science offered by the Department of Computer Science in the Faculty of Engineering.