Discrete

Structure (DM)
(Performance Task)

Submitted To: John Eric Mamuyac

Submitted by: Jerecho D. Tesiorna
Course&Section: BS.Cpe/BE201
Define the following:

1. What is a proposition?

2. What is a truth table?

Determine whether each sentence is a Proposition. If the sentence is a proposition, write it’s
negation. If not write not proposition

3. Audrey Meadows was the original “Alice” in “The Honeymooners.”

4. Peel me a grape.

5. The line “Play it again, Sam” occurs in the movie “Casablanca”

6. The difference of two primes

Write the negation of the proposition.

7. Ten heads were obtained.

8. Some heads were obtained

9. Some heads and some tails were obtained

 10. At least one head was obtained

Given that proposition p is false, proposition q is true, and proposition r is false, determine whether
each proposition is true or false.

11. p ∨ q

12. ~p ∨ q

13. ~(p ∨ q) ∧ (~p ∨ r)

14. (p ∨ ~r) ∧ ~((q ∨ r) ∨ ~(r ∨ p))

15. ~p → ~q

16. ~p → ~( q ∧ r)

Write the truth table of each proposition.

17. ( p ∨ q) ∧ ~p
18. ( p ∧ q) → (~p ∨ q)

19. (~p ∨ ~q) ↔p

20. ~(p ∧ q) ∨ p

21. (p ∨ q) ∧ (~p ∨ q) ∧ (p ∨ ~q)

Formulate the symbolic expression in words using:

P: Today is Monday

Q: It is raining

R: It is hot.

22. p ∨ q

23. ~(p ∨ q) ∧ r

24. ~p ∧ (q ∨ r)

25. ( p ∧ q) ∧ ~(r ∨ p)

26. (p ∧ (q ∨ r)) ∧ ( r ∨ (q ∨ p))

Write a truth table of each proposition using precedence of logical operators.

27. p ∨ q → r
28. p ∧ q ∧ ~r ∨ p

29. ~p → ~q ∧ ~r ∨ p

30. p ∨ q → ~r ∧ s ↔ ~q