CO 464ACombinatorial Applications of Computer 1
- Faculty
- Mathematics
- Last listed
- 1980–81
No longer offered. It’s in Waterloo’s scanned calendars from 1979–80 to 1980–81; the 1995–96 to 2023–24 calendars are on ucalendar.
General topics: methods of data storage for combinatorial problems, representation of sets, etc. Algorithms for permutations, combinations, partitions, etc. The use of generating functions, and methods of handling them on a computer. Enumeration problems: Polya’s theorem and variations. Applications. Course Descriptions 381 Combinatorics and Optimization
As printed in the 1979–80 to 1980–81 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: Math 321a/b and two of CS 140, 180, 240, 250
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1979–80 to 1980–81, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1979–80 to 1980–81 2 calendars
General topics: methods of data storage for combinatorial problems, representation of sets, etc. Algorithms for permutations, combinations, partitions, etc. The use of generating functions, and methods of handling them on a computer. Enumeration problems: Polya’s theorem and variations. Applications.
Course Descriptions 381 Combinatorics and Optimization
Prereq: Math 321a/b and two of CS 140, 180, 240, 250