CSCI 2710 -- Discrete Structures
Test 3 Study Guide

The table below lists the assigned reading and some problems from the textbook that might be helpful as you study for Test 3. There is no test from last semester that exactly matches what you will be responsible for in Test 3. Your test will be a combination of problems 21 through 31 from the Fall 2004 Test 2 and all of the Fall 2004 Test 3.

Once again, do not be intimidated by the number of sample problems listed in the table below. Many of these problems are similar to each other or they are quite trivial. You will be given the full exam period to take the test. I will not be asking you to define any terms, but I will expect you to know the term when I use it in a question. There will not be any questions asking for proofs either.

You will not be allowed to use a calculator during the test nor will you have access to your notes or a cheat sheet. Since there are no theorems and such of any consequence for this section of material, I don't think it will be necessary to provide you with any such information on the front page of the test.

Good luck!

Topic Reading Sample problems
Product Sets 4.1 1 through 11, 16, and 18 through 21
Relations and Digraphs 4.2 1 through 13 and 23 through 29 (Problem 29 uses the same method we proposed in class for determining whether the matrix of a relation represented a function or not.)
Properties of Relations 4.4 1 through 18 and 25 through 28
Equivalence Relations 4.5 1 through 10
Functions 5.1 Exercises 1 though 8
Functions for CS 5.2 Example 10 and Exercises 1 through 4, 24, 25, and 26
Growth of functions 5.3 Please understand the example used throughout the PowerPoint slides for the 11/9 lecture, specifically the way different methods affect the complexity of our software routines.
Trees 7.1 Exercises 1 through 19, 28, 29, and 30
Labeled Trees 7.2 Exercises 1 through 14 and 16 through 27
Tree Searching 7.3 Exercises 1 through 28, 31, 32, 35, and 36
Minimal Spanning Trees 7.5 Exercises 1 through 15