Note: The exam is basically cumulative, but with slight emphasis on the later material not yet touched on in Midterms I and II. It is designed for 2 hours, but you will have the full 2 1/2 hours of the period. There will be 10 problems worth 150 points total, plus a bonus problem worth up to 20 points. The number [ ] of questions for each chapter covered is as follows: 1.1-5 , 3.1-5 , 4.1-7 , 6.1.3 , 7.1-3 , 8.1-4 & 8.6 . Make sure you fully include the posted Guides for Midterm I and Midterm II in your review for the Final. Continuing from there, you should understand the concept of efficient networking in 6.3 and feel comfortable with using Prim's Algorithm for finding a minimal spanning tree. For Chapter 7, look at some tiling problems in the plane and study the description of the five regular polyhedra in space. You should also be able to apply Euler's Formula for convex polyhedra to simple questions relating the number of vertices, edges, and faces. In Chapter 8, study the basic topics of divisibility and prime numbers. It can be helpful to use the Euclidean Algorithm for finding greatest common divisors. You must have some fluency with modular arithmetic and know a little about the applications to check digits and affine ciphers. Section 8.7 contains some important and exciting additional topics - strongly recommended as optional reading, but not required for the Final and regular course work.
Some formulas will again be provided for the test. You may use a calculator as specified in the Course Description, but it will not be needed for most of the problems.
You must bring your Stony Brook ID.
You will be well prepared for this exam if you carefully review all the assigned homework as well as the many detailed problems discussed in class. We suggest to look at some of the following additional review problems:
pp416-417 11 16 pp462-463 6 12 14 pp536-537 1 2 4 10 19 24Make sure to check for possible additional announcements and instructions for this exam regularly.
May 06, 2007