MATH 457AThis course will be concerned with the combinatorial
- Faculty
- Mathematics
- Last listed
- 1975–76
No longer offered. It’s in Waterloo’s scanned calendars from 1975–76 to 1975–76 (before that, 1972–73 used the number for Applied Combinatorial Mathematics-A); the 1995–96 to 2023–24 calendars are on ucalendar.
problems of retrieving data from a store and discusses the principal algorithms for doing this. Methods for constructing appropriate relational structures and their stability are considered, as well as devices for improving substantial gains in efficiency. _
As printed in the 1975–76 calendar, 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.
1975–76 1 calendar
problems of retrieving data from a store and discusses the principal algorithms for doing this. Methods for constructing appropriate relational structures and their stability are considered, as well as devices for improving substantial gains in efficiency. _
Not in the 1973–74 to 1974–75 calendars.
1972–73 1 calendar
Another title: Applied Combinatorial Mathematics-A, probably a different course under the same number (or a misread scan).
A selection of combinatorial problems from the applied sciences. Topics which might be included are: Markov chains, random walk, the Polya problem, the dimer (and monomer-dimer) problem, the Ising problem, percolation processes, probabilistic graphs, electrical network theory. 2 hours lectures, one term. Prerequisites: Math 35la and Math 233.