CSE 321 Assignment #1
Autumn 1997

Due: Friday, October 10, 1997.

Reading assignment: Read 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.1, problems 7, 15, 27; Section 1.2, problems 7, 9, 27.

Problems:

  1. Section 1.1, Problem 8, all parts except (d).

  2. Section 1.1, Problem 22 (a), (c).

  3. Section 1.1, Problem 28.

  4. Section 1.2, Problem 8, parts (a) and (b).

  5. Section 1.2, Problem 10, parts (c) and (d).

  6. Find an disjunctive normal form (DNF) proposition equivalent to ((p->NOT q)->r). Hint: For each row of the truth table of the proposition see how to find a compound proposition that is true on that row and no others. 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.

  7. (Bonus) Section 1.2, Problem 26.

  8. (Bonus) Section 1.2, Problem 38. Recall that in the notation of the text `p|q' means `p NAND q'.