CSE 321: Discrete Structures Autumn 2008
Assignment #1 Due: Wednesday, October 8
Problems: 1. Section 1.1, exercise 10 2. Section 1.1, exercise 18, parts (a) to (e) 3. State in English the converse and contrapositive of each of the following impliations:
Midterm Practice with Solutions
1. Answer the following questions with True or False: (a) (p q) (q p) T (b) (p q) (p q) T (c) If A and B are sets, A  B = A B. F (d) If ab and ac, then bc. F (e) If a(b + c), then ab and ac. F Let P (x, y) be the sta
cl. t
hao
^ t eo wuth,
UR l1enot /e?
otlt L Lb
,:.1,),L.
" ?vr.l., R,&' ' '^iff OVJrd i e . / c,Ln' n
nf tt' , tt',*t
a t?,t?l*
ltald' L
nr* n'
Yl.a^ hr tfzcfw_nl

*#l
Itctd
uti'(4 'w lu fz tlt ?4L
Z C, z t , Z V
22 
l O. l , t
]*rrrrut'rrt hd;.*t
CSE 321 final exam sample questions Fall 2006
These are final exam questions from previous offerings for the course. Since lecture
topics vary from year to year, some of the questions relate to material that was not
presented this year. The final will cov
CSE 321
Sample Questions from Old Midterms
Fall 2005
Instructions: Closed books, closed notes, no calculators,
work all problems.
In 50 minutes there would be 57 of these questions:
1.
Let T(n) be defined by: T(0) = 1,
T(n)=2*n*T(n1).
Prove that for all
CSE 321 Solutions to Practice Problems
Instructions: Feel free NOT to multiply out binomial coefficients, factorials, etc, and feel free to leave answers in the form of a sum. No calculators, books or notes are allowed. 1. True or False: p q is logically
CSE 321
Sample Questions from Old Midterms
Fall 2006
Instructions: Closed books, closed notes, no calculators,
work all problems.
In 50 minutes there would be 57 of these questions:
1.
Let T(n) be defined by: T(0) = 1,
T(n)=2*n*T(n1).
Prove that for all
CSE 321
Discrete Structures Midterm Topic List
Spring 2009 W. L. Ruzzo
The midterm covers everything in chapters 1, 2 and 4, except 4.5. Briefly, this includes: Logic propositions, , , , , , tautology, satisfiability, contingency, converse, contrapositive
CSE 321
Discrete Structures Final Exam Topic List
Spring 2009 W. L. Ruzzo
You may bring one sheet of notes (both sides, handwritten, 8.5 x 11, no magnifying glasses, epaper, microfilm,.) The final is comprehensive, but with a slight emphasis on topics co
CSE 321: Discrete Structures Autumn 2008 Problems:
Assignment #7 Due: Monday, December 1
1. When a test for steroids is given to soccer players, 98% of the players taking steroids test positive and 12% of the players not taking steroids test positive. Sup
CSE 321: Discrete Structures Autumn 2008 Problems: 1. Section 5.5, exercise 10
Assignment #6 Due: Wednesday, November 19
2. How many ways are there to select 7 cards from a standard deck of 52 playing cards so that there are at least 5 cards of the same s
CSE 321: Discrete Structures Autumn 2008 Problems:
Assignment #3 Due: Wednesday, October 22
1. Prove or disprove: n2 + 3n + 1 is always prime for integer n > 0. 2. Prove that if n is an integer then n2 mod 8 is either 0, 1, or 4. Hint: Consider the differ
CSE 321: Discrete Structures Autumn 2008 Problems: 1. Section 1.5, exercise 16, parts (a) to (c) 2. Section 1.5, exercise 24 3. Section 1.5, exercise 34
Assignment #2 Due: Wednesday, October 15
4. Prove that for any integer n if 3n + 3 is odd then n is ev
CSE 321 Practice Problems from Old Finals
Instructions: Feel free NOT to multiply out binomial coefficients, factorials, etc, and feel free to leave answers in the form of a sum. No calculators, books or notes are allowed. 1. True or False: p q is logical