CSE 321 Assignment #2
Autumn 1998
Due: Friday, October 9, 1998 at the beginning of class.
Reading assignment: Finish reading the text, Discrete Mathematics and Its
Applications, sections 1.1 - 1.3. Skim sections 1.4-1.8 of the text (except
for pages 76-77, which we may cover later in the course.)
The following problems are from the Third Edition of the text.
Practice Problems: Section 1.2, problems 7, 9, 27.
Problems:
- If you haven't yet handed in the index card with your picture and
name on it, please do so this week.
- Section 1.2, Problem 8, parts (b) and (d).
- Section 1.2, Problem 10, parts (c) and (d).
- Find an disjunctive normal form (DNF) proposition equivalent
to ((p OR NOT q)->r).
Hint: For each row of the truth table of the proposition see how to find a
compound proposition that has truth value true in that row but is false in all
other rows. This proposition should be an AND of variables and their
negations. Then you should make an OR of these propositions that is true
exactly when the original compound proposition you were given is true.
- Section 1.2, Problem 26. (Use the same idea as the previous problem.)
- Section 1.2, Problem 34. Read the definitions for this problem above
problems 27 and 30 and read the solutions to problem 27 & 29.
- Section 1.3, Problem 6.
- Section 1.3, Problem 10.
- (Bonus) Section 1.2, Problem 38. Note that in the notation of the text
`p|q' means `p NAND q'.