The table below lists the assigned reading and some problems from the textbook that might be helpful as you study for Test 2. As with last time, there are two old tests to go from. Test one from Fall 2004 is slightly different, so use the list below to determine what you will be responsible for on our test.
The test questions will be as close as possible to the sample problems given in the table below. Do not be intimidated by the number of sample problems listed in the table. Many of these problems are similar to each other or they are quite trivial. You will be given the full class period to take the test.
Much of what we have studied since Test 1 is difficult to write questions for. There are the two sections on methods of proofs and then there are the loads of definitions. 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.
As for the proofs, I will not expect you to tell me what proof method to use. I will, however, ask you to prove a simple proof using mathematical induction. (I figure this is fair game since we did a bunch of these in class.) To test you on the other methods, I will show you a proof/argument and ask you to tell me whether it is valid or not. This will be much like problems 1 though 9 of section 2.3. To help you here, I will give you a list of all of the tautologies from section 2.2 on the front cover of the test along with the tautologies defining modus ponens, the indirect method, and proof by contradiction. (Note that modus ponens was not on the cover sheets from any of the previous tests.)
You will not be allowed to use a calculator during the test nor will you have access to your notes or a cheat sheet. I will, however, give you a short list of some of the theorems we discussed in class similar to that for the Spring 2005 test. Once again, note that modus ponens will be added to this list..
| Topic | Reading | Sample problems |
| Propositions and Logical Operations | 2.1 | 1 through 19 and 23 through 26 |
| Conditional Statements | 2.2 | 1 through 12, 17, 18, and 20 through 31 |
| Methods of Proof | 2.3 | 1 through 11 (Use problem 11 to see how tautologies are used in proofs.) |
| Mathematical Induction | 2.4 | 1 through 7, 10, and 11 |
| Permutations | 3.1 | 1 through 6, 8 through 16, 24, and 25. |
| Combinations | 3.2 | 1, 2, 4 through 13, 17, 18, and 20 through 26. |
| As for the material from the previous two sections, I need you to be able to determine which method should be used for which application. In other words, given a situation where you are told whether order matters and if duplicates are allowed, you should be able to tell me which formula to use. | ||
| Probability | 3.4 | 1 through 20 and 26 through 36 | .
Prepared by David L. Tarnoff for his sections of CSCI 1900 at ETSU