MATH 418ACombinatorial Applications of Computers
- Faculty
- Mathematics
- Last listed
- 1975–76
No longer offered. It’s in Waterloo’s scanned calendars from 1972–73 to 1975–76; 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. Useful for students wishing to specialize in the more computationally-oriented aspects of graph theory or operations research. 2 hours lectures, one term. Prerequisites: Practical knowledge of at least one computer programming language. 329-algebra.
As printed in the 1972–73 to 1975–76 calendars, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1972–73 to 1975–76, 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.
1972–73 to 1975–76 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. Useful for students wishing to specialize in the more computationally-oriented aspects of graph theory or operations research. 2 hours lectures, one term. Prerequisites: Practical knowledge of at least one computer programming language. 329-algebra.