CO 438BCombinatorial Computing
- Faculty
- Mathematics
- Offered
- Winter
- Credit
- 0.5
- Last listed
- 1985–86
No longer offered. It’s in Waterloo’s scanned calendars from 1985–86 to 1985–86 (before that, 1976–77 to 1978–79 used the number for Combinatorial Applications of Computers 2); the 1995–96 to 2023–24 calendars are on ucalendar.
A course covering a number of applications of computers to combinatorial problems. General procedures — backtrack programming, generation of permutations, partitions etc., as well as the solution of many specific problems. includes an introduction to computational complexity.
As printed in the 1985–86 calendar, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: C&O 230
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1976–77 to 1985–86, 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.
1985–86 1 calendar
A course covering a number of applications of computers to combinatorial problems. General procedures — backtrack programming, generation of permutations, partitions etc., as well as the solution of many specific problems. includes an introduction to computational complexity.
Prereq: C&O 230
Offered Winter · 3 class hours a week · 0.5 credit
Not in the 1979–80 to 1984–85 calendars.
1976–77 to 1978–79 3 calendars
Another title: Combinatorial Applications of Computers 2, probably a different course under the same number (or a misread scan).
Methods for searching and sorting. Tree-like data structures: branch and bound methods. Back-track methods. Boolean programming. Construction problems: construction of. graphs, digraphs, trees. The cell-growth problem and its variations.
Prereq: At least one computer programming language. Math 331, C&O 438a. 2 hours lectures, one term