Mathematics 222a 2001

#### Course Outline

**Instructors**: D. Christensen and S. A. Rankin.

**Textbook:**

- Mathematics for Computer Scientists, Volume I: The Fundamentals, Fifth Edition 2001, by S. A. Rankin and I. J. W.
Robinson, published by Kinson Publishing Ltd.

**Prerequisites:**

- One full course equivalent chosen from Mathematics 030, Applied
Mathematics 026, Calculus 050a/b, 051a/b, 081a/b, Linear Algebra 040a/b,
or the former Applied Mathematics 020, or 023a/b plus 024a/b, or the
former Mathematics 027 (in each case with a minimum grade of "C"); plus
one full course chosen from Computer Science 025a
or 026a/b and 027a/b (in each case with a minimum grade of "C").

**Course Outline:**

- Mathematical induction.
- Set theory.
- Counting: permutations, combinations, the binomial theorem.
- Relations and functions.
- Equivalence relations and partitions.
- Partial orders and lattices.
- Group theory and applications to error detecting and correcting codes.

**Evaluation of Student Performance**:

- Two quizzes, each worth 5% of the final mark.
- Two term tests, each worth 20% of the final mark.
- A final examination, worth 50% of the final mark.

**Examination Dates**:

- Saturday, October 13, 2001, 9:30am--12:00 noon.
- Saturday, November 10, 2001, 9:30am-12:00 noon.
- Final examination in the December exam period, to be scheduled by the Office of the Registrar.

Return to Mathematics 222a Course Page