29 courses in the 1984–85 Undergraduate Calendar, read from the scanned original. The text comes from OCR, so check the scanned page before relying on a detail.
Elementary principles of enumeration. Principles of inclusion ~ exclusion, generating functions, recurrence equations. Elementary graph theory and graphical algorithms. Introduction to design theory.
Credit will be granted for only 1 of C&O 220, 230. C&O 220 cannot be counted for credit toward a BMath Honours degree.
Offered at St. Jerome's College in Winter term.
Introduction to the combinatorics of ordinary and exponential generating functions. Introduction to basic graph theory and graphical algorithms.
Prereq: MATH 134b
Credit will be granted for only 1 of C&O 220, 230.
Structure and classification of optimization problems. The concepts of algorithm and heuristic. Continuous models. Linear models. Methods of branch-and-bound, implicit enumeration and approximation. Applications.
Prereq: MATH 130b, 134b
Students may not enrol in C&O 270 if they have previously completed, or are concurrently enrolled in, C&O 350 or 367.
Also offered at St. Jerome's College in Fall term.
The combinatorics of ordinary and
exponential generating functions. Matrix
methods, and decompositions. The
Lagrange theorem. Applications to
enumeration of sequences, trees.
covers, lattice paths and partitions. “Prereq: C&O 230
A first course in error-correcting codes. Linear block codes, Hamming-Golay codes and multiple error-correcting BCH codes are studied. Various encoding and decoding schemes are considered. Prereq: MATH 224b Offered at St. Jerome's College.
An introduction to the ideas, methods
and applications of graph theory.
Finding shortest paths and maximum
matchings in weighted graphs.
Determining the connectivity of a graph. Prereq: MATH 224a, C&O 230
C&O 43 W SC 05 Graph Theory 2 A continuation of C&O 342. Planar graphs and embeddings in other surfaces. Vertex, edge and. face cotourings. The four-colour problem. Hamilton cycles. Applications to scheduling problems.
Prereq: C&O 342
A first course in problem formulation and solution techniques in linear programming. The simplex and revised simplex methods. Active set formulation of the simplex method. Theory and applications of duality theory. Sensitivity Analysis.
Prereq: MATH 2242
16.91
Review of linear programming. Shortest path problems. The max-flow and minimum cost-flow problems. A study of the network simplex, augmentation and out-of-kilter algorithms. Applications to problems of transportation, distribution, man-job assignments and critical-path planning.
Prereq: C&O 350
Vector calculus with applications to Newton's method and method of steepest descent. One-dimensional optimization. Introduction to constrained optimization, including the elements of Kuhn-Tucker theory and Lagrange multipliers.
Prereq: MATH 220a, 224a
An applications-oriented course that ilustrates how various mathematical . models and methods of optimization can be used to solve problems arising in business, industry and science. Prereq: C&O 350
An introduction to the use of probabilistic models in operations research. Techniques and applications of queueing theory, inventory theory and reliability theory.
Prereq: STAT 221
A course in problem solving. 100 problems are studied. Problems are taken mainly trom the elementary parts of algebra, geometry, number theory, combinatorics and probability.
Prereq: MATH 130a/b, 134a/b. (220a/b, 224a/b, are recommended)
Although the mathematics for this course is technically elementary, the course is intended for third and fourth year students, and the mathematical maturity of @ senior student will be assumed.
An introduction to the combinatorial aspects of the real plane. Main topics covered are the enumeration of various combinatorial objects in the plane, Sylvester's Triad Problem, Pick’s Theorem, partitioning the interior of a rectangle into squares of different sizes, an introduction to the theory of convex sets in the plane. Helly’s theofem and certain ramifications will be explored.
Prereq: MATH 130a/b, 134a/b Although the mathematics for this course is technically elementary, the course is intended for third and fourth year students, and the mathematical maturity of a senior student will be assumed. Offered at St. Jerome's College.
The course is an extension of C&O 330. The combinatorics of Eulerian generating functions, the algebra of sequence types, maximal decomposition theorem. Lagrangian methods and their applications. Random walks and the Hopt factorization. Symmetric functions and plane partitions.
Prereq: C&O 330
Topics covered include error correcting codes, resolvable designs, affine designs, weighting matrices, and their interaction.
Prereq: MATH 324
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
An undergraduate seminar in combinatorics. The primary objective is to study current work in specific areas of combinatorics. Course content may vary from term to term.
Prereq: Consent of instructor
An indepth study of 1 or 2 topics in graph theory. Course content may vary from term to term. Topics may include planar graphs, external graph theory, directed graphs, enumeration, algebraic graph theory, probabilistic graph theory, connectivity, graph embedding, colouring problems.
Prereq: C&O 342 or consent of instructor
Packing, cavering and partitioning problems. Integer programming. Good algorithms for optimum assignments, matchings, flows, anti-chains and connectivity. Paths, trees and flowers. Min-max relations. Convexification of discrete problems. Vertices and facets of convex polyhedra. The concepts of NP and co-NP. Reducing NP problems to integer programming.
Prereq: C&O 351
A study of several techniques for solving integer (linear) programming problems. Cutting planes, implicit enumeration, branch-and-bound, Introduction to Boolean and pseudo- Boolean programming. Applications to problems of optimum routing, site location, set covering and packing, logic and lattice theory.
Prereq: C&O 351
Sequencing algorithms for scheduling
tasks on single machines, parallel
machines, and flow shops. Applications
to scheduling computers and
manufacturing facilities. Combinatorial
techniques used in algorithm
development and convergence proofs. Prereq: C&O 351 or 370
An introduction to the analysis, through
appropriate mathematical models, of
competitive situations such as those
arising in social, economic, political or
military conflict. Emphasis is placed on
the theory of two-person games. Prereg: C&O 350
Course Descriptions Combinatorics and Optimization
Methods for the minimization and maximization of piecewise linear functions apd linear functions subject to linear constraints, with applications to linear programming and data fitting. Emphasis is on algorithms, numerical considerations and software implementation.
Prereq: One of C&O 350, CS 337, 375 or consent of instructor
Cross-listed as CS 473.
An undergraduate seminar in optimization. The primary objective is to study recent work in specific areas of optimization. Course content may vary from term to term.
Prereq: Consent of instructor
A detailed presentation of optimality conditions and effective algorithms for the solution of a quadratic programming problem. All concepts are developed as natural extensions of their counterparts in linear programming. Applications from portfolio analysis, engineering plasticity, regression, pattern recognition.
Prereq: C&O 360
Geometry and numerical algorithms of nonlinear optimization. Variable metric and conjugate gradient methods. Convex programming. Feasible and nonfeasible direction methods. Recursive quadratic programming, nonorthogonal projections and active set strategies.
Prereq: C&O 350, 367
Topics include: famous construction problems, Mascheroni’s theorem, Amicable pairs, perfect numbers and related numbers; Phythagorean triples; some of Archimedes’ great accomplishments: squaring the parabola; estimation of pi, Archimedes’ “Method”, the volume of the sphere; inscribed regular polygons. Prereq: MATH 130a/b, 134a/b (220a/b and 224a/b are recommended) Although the mathematics for this course is technically elementary, the course is intended for third and fourth year students, and the mathematical maturity of a senior student will be assumed.
Combinatorics and Optimization
A continuation of C&O 480 (History of Mathematics 1), but may also be taken independently. Topics include: the Fibonacci sequence; prime numbers; Fermat's last theorem; Gaussian integers: Euler’s formula and regular solids; famous problems in geometry. Prereq: MATH 130a/b, 134a/b (220a/0, 224a/b are recommended) Although the mathematics for this course is technically elementary, the course is intended for third and fourth year students, and the mathematical maturity of a senior students will be assumed.
Prereq: Consent of department
Computer Science
Course Descriptions Introductory Notes
1. The Department of Computer Science has 2 distinct streams of courses, 1 exclusively for students who have been admitted to a Computer Science Major program.
and another especially designed for non-specialists who wish to become sophisticated computer users. Within
this context, Computer Science Major programs include Honours Computer Science, Honours Co-op Computer Science with Electrical Engineering Electives, Honours Coop Computer Science-information Systems Option, all Joint and Double Honours BMath programs involving Computer Science as one of the majors.
The non-specialists’ courses will not normally be open to Computer
Science Major students, but they will
be available to all other students in the University, subject to resource limitations. These courses are numbered with a middle digit of 0 through 3.
Where resources permit, students
with exceptionally high academic standing in other programs may be considered for admission to CS
Major Courses on an individual basis.
To be considered, students should
first obtain a written recommendation from their Faculty Advisor and then consult a Computer Science Advisor.
The Computer Science Department is experiencing tremendous demand for its courses beyond available resources. Thus, accessibility to Computer Science courses. cannot be guaranteed to all students. Every effort will.be made to accommodate those students who preregister during published University Preregistration periods. While priority
will be given to these preregistrants.
admission to specific courses cannot be guaranteed.
Co-op students will not normally be permitted to enrol in any Computer Science courses while on a work term. All other part-time students, as well as full-time non-degree and post-degree students, will normally be limited to at most 1 Computer Science course per term from the non-specialist offerings. (Post-degree students on leave from their home institution should consult a Computer Science Advisor to arrange an appropriate selection of courses.) For courses that are oversubscribed, however, priority for registration will normally be given to students registered full-time in a
Limits on the number of CS courses Students may take concurrently will be published at preregistration time. Normally, all students in first and second year may preregister for at most 1 CS course per term, and students other than Computer Science Majors may preregister for at most 2 CS courses per term in third and fourth year.
Computer Science courses may not normally comprise more than onethird of a student's total credits accumulated at the University of Waterioo.
Please note that the terms in which courses are offered may deviate from those published below. Students are advised to consult the University Course Offerings List.
More detailed course descriptions and course outlines are available upon request from the Computer Science Department. Students in faculties other than mathematics should take particular note of the
16.93
following courses: CS 112, 115, 116, *118, 234, 235, 316.
8. For the purposes of prerequisites, the following courses are normally considered to be equivalent: (CS 234 and 240), (CS 235 and 250), (CS 334 and 340), and (CS 335 and 350/354).
9. The prerequisite phrase “x-year standing” means that a student must be registered in year x or higher.