CO 438ACombinatorial Applications. of Computer 1
- Faculty
- Mathematics
- Last listed
- 1978–79
No longer offered. It’s in Waterloo’s scanned calendars from 1976–77 to 1978–79; 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 ona computer. Enumeration problems: Polya’s theorem and variations. Applications.
As printed in the 1976–77 to 1978–79 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prerequisites: At least one computer programming language. Math 321/331. 2 hours lectures, one term
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1976–77 to 1978–79, 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.
1976–77 to 1978–79 3 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 ona computer. Enumeration problems: Polya’s theorem and variations. Applications.
Prerequisites: At least one computer programming language. Math 321/331. 2 hours lectures, one term