[an error occurred while processing this directive]

MTH210

Final Exam Information

Ryerson University
[an error occurred while processing this directive]

(none)

[an error occurred while processing this directive]

(none)

[an error occurred while processing this directive]

(none)

[an error occurred while processing this directive]

Due: (none)

Information

Please note that exam times and rooms are booked centrally. The online schedule can be found here.

The Final Exam will be on Thursday April 22, 2010, 8:00AM - 11:00AM, in KHW 073 (also known as "the lower gym").

The following is copied from the Ryerson Examination Page

In order to ensure the academic integrity of exams, students are asked to:

Please see the main Ryerson Examination Page for more information about examinations.

You are not allowed electronic devices on the desk. If you think you need it buy yourself a cheap watch to keep time, cell phones are not allowed.

Aids

You are allowed one 8½" x 11" formula sheet, written on both sides, which you prepare yourself.
You should prepare this formula sheet beforehand with any material you feel is relevant.

No other aids are allowed, in particular no calculators.

Office Hours

I will be holding office hours in my office (ENG 223) on Wednesday April 21 from 10 - 2.

Material Covered

The final is comprehensive and covers all material in the course. However, material that you have not been tested on will be emphasized. Check the course outline for details. Also check the course handouts for extra material.

Induction and Recursion

Chapter 4 4.1, 4.2, 4.3, 4.4 (Not including "The well Ordering Principle for the Integers" p. 240- 242.),
Chapter 8 8.1, 8.2, 8.4
Handouts: Induction & Recursion handout
Fibonacci Sequence
Structural Induction handout

Graph Theory

Chapter 11 11.1, 11.2, 11.4, 11.5
Handouts Introduction to Graphs
Hamiltonian and Eulerian Graphs
Graph Isomorphism
Trees

Theory of Computation

Chapter 5 5.4.
Chapter 7 7.5 (Particularly 453-454).
Chapter 12 12.1, 12.2
Handouts Regular Expressions
Computability handout (contains extra material not (well) covered in the book).

Number Theory

Chapter 3 3.8 (Review)
Chapter 10 10.4
Handouts The Euclidean Algorithm
Prime Fields
Cryptography and RSA

Counting and Probability

In the Probability handout we covered Sections 1, 2 (the binomial distribution), 4 and 6; but not Sections 3 and 5. Note that we did not cover Section 6.9 from the book.

Chapter 6 6.1 - 6.8.
Handouts Counting
Combinations & Permutations
Probability

Studying Suggestions

The lab questions assigned in this course were designed to give you an opportunity to apply the concepts learned in the lectures. For this reason, it is a good idea to review the questions you had trouble with in the labs.

You can also try the recommended problems given in the course outline. These are especially useful if you need to review a particular area.

Old Exams

Old Examinations are posted on the Old Exams page. Unfortunately, I do not have a copy of last years Final.

Note that the order and emphasis is somewhat different from year to year.

How to use old tests

I suggest the following when studying for a test:


This page is maintained by Peter Danziger.
Last modified Monday, 19-Apr-2010 09:27:13 EDT