Computer Science Assignment

Computer Science 1 – FALL 2013 - Assignment 3

Please write answers on a separate sheet of paper. YOU MUST STAPLE ALL PAPERS TOGETHER AND HAVE YOUR NAME AND CLASS SECTION INFORMATION ON EACH SHEET OF PAPER. For questions 1 through 3 You must show your work to get full credit.

1. (12 points) Simplify the following expression: not((not(Q) and R) imp not(P))

2. (14 points) Simplify the following expression: not(not(P) and Q) imp (not(R) and (P or not(Q)))

3. (15 points) Simplify the following expression:
((R or not(Q)) and not(P)) or (not(not(R) imp not(Q))) 4. (9 points) Consider the following truth table:

P
Q
R
????
T
T
T
F
T
T
F
T
T
F
T
F
T
F
F
F
F
T
T
F
F
T
F
F
F
F
T
T
F
F
F
F

Please write a proposition which would have the table above as its truth table.
Answer MUST BE IN SIMPLIFIED FORM

QUESTION 5 on next page

5. (20 points = (5 x 4 points) For each of the following arguments, indicate what rule (Denying the consequent (DC) , Affirming the antecedent (AA) , or Disjunctive syllogism (DS)) can be used to justify the conclusion. You must show your work as discussed in lecture to get full credit.
i.e. P1: P2: C:

a. Payton doesn't bake chocolate chip cookies for dessert if his friend Micky comes over to play before dinner. Hence Payton doesn't bake chocolate chip cookies for desert since his friend Micky came over to play before dinner.

b. Either Sally or her brother babysit their younger sister Friday night. Sally's brother has to go to a meeting at school Friday night. Therefore, Sally babysits their younger sister Friday night.

c. Lori goes to the park to play baseball Saturday only if she doesn't have to clean the living room Saturday. So Lori doesn't go to the park to play baseball Saturday because she has to clean the living room Saturday.

d. Henny walks around the lake Sunday afternoon if