CO 438Combinatorial Computing
- Faculty
- Mathematics
- Last listed
- 1994–95
No longer offered. It’s in Waterloo’s scanned calendars from 1981–82 to 1994–95; the 1995–96 to 2023–24 calendars are on ucalendar.
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 intro- duction to computational complexity. Prereq: C&O 230. Some programming experience is required.
As printed in the 1993–94 to 1994–95 calendars, read by OCR; the scanned page is the original. Later calendars (1995–96 on) aren’t on uwloo.
Check it elsewhere
- Undergraduate Calendar, 1995–96If it ran past 1994–95, on ucalendar
- Course outlinesSyllabi from past terms (UW login)
- UW FlowStudent ratings and reviews
- WClassesPast sections back to 2004, and who taught them
In the scanned calendars
How it read in each calendar from 1981–82 to 1994–95, 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.
1993–94 to 1994–95 2 calendars
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 intro-
duction to computational complexity. Prereq: C&O 230. Some programming
experience is required.
1981–82 to 1992–93 9 calendars
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 Fall · 3 class hours a week · 0.5 credit