MATH 418(a) Combinatorial Applications of Computers — A \
- Faculty
- Mathematics
- Last listed
- 1974–75
No longer offered. It’s in Waterloo’s scanned calendars from 1972–73 to 1974–75 (before that, 1971–72 used the number for Computer Oriented Graph Theory); the 1995–96 to 2023–24 calendars are on ucalendar.
Branchings in networks. Elementary matroid theory illustrated by forests, transversals, algebraic dependence, and geometry. Matroid partitions and intersections. Submodular functions and polymatroids. Recommended for students interested in theoretically advanced study in Combinatorics and Optimization or Computer Science. 2 hours lectures, one term Prerequisite: M417 (a) or consent of instructor 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. oo. 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. Algebra (M319/329) Faculty of Mathematics -
As printed in the 1974–75 calendar, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1971–72 to 1974–75, 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.
1974–75 1 calendar
Branchings in networks. Elementary matroid theory illustrated by forests, transversals, algebraic dependence, and geometry. Matroid partitions and intersections. Submodular functions and polymatroids. Recommended for students interested in theoretically advanced study in Combinatorics and Optimization or Computer Science. 2 hours lectures, one term Prerequisite: M417 (a) or consent of instructor
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. oo. 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. Algebra (M319/329)
Faculty of Mathematics
-
1972–73 to 1973–74 2 calendars
Methods for searching and sorting. Tree-like data structures: branch and bound methods. Back-track methods. Boolean programming. Gonstruction problems: construction of graphs, digraphs, trees. The~ cell-growth problem and its variations. 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. Algebra (M 329). M 418 (a) is a prerequisite for M 418 (b)
1971–72 1 calendar
Another title: Computer Oriented Graph Theory, probably a different course under the same number (or a misread scan).
A general survey of those problems in graph theory that are amenable to the use of computing techniques. Algorithms for testing graphs for given properties, e.g. planarity, isomorphism. Algorithms for constructing graphs with given properties, or finding all subgraphs of a given kind, e.g. spanning trees, circuits. Combinatorial algorithms, etc. The emphasis of the course will be on the algorithms, rather than the details of computation; but students will be expected to implement these algorithms on the computer. 2.hours lectures.