Logic and Discrete Mathematics Practice Test 1, Exams of Discrete Mathematics

A practice test for CSE 240: Logic and Discrete Mathematics. The test includes questions on negation, predicates, propositional variables, and propositional equivalence. The questions require the student to write in good English and use logical operators. The document also includes answers and explanations for each question.

Typology: Exams

2021/2022

Uploaded on 05/11/2023

alpa
alpa 🇺🇸

4.4

(20)

249 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE 240: Logic and Discrete Mathematics
Practice Test 1
Name:Student Number:
1. Write the negation of each statement in good English. Do not write “It is not true that...”
a. Some bananas are yellow. No bananas are yellow
b. All integers ending in the digit 7 are odd. There are some even integers ending in the digit 7
c. No tests are easy. Some tests are easy
d. Roses are red and violets are blue. Some roses are not red, or some violets are not blue
e. Some skiers do not speak Spanish. All skiers speak Spanish
2. Let predicate T(x, y) denote that student xis taking course y, and predicate P(x, y) denote
that student xhas passed course y. Write each of the following statements in good English. Do
not use variables in your answers.
a. ¬P(John,CSE 131) John has not passed CSE 131
b. yxT (x, y)There is a course that all students have taken
c. xyT (x, y)Each student has taken some course
pf3

Partial preview of the text

Download Logic and Discrete Mathematics Practice Test 1 and more Exams Discrete Mathematics in PDF only on Docsity!

CSE 240: Logic and Discrete Mathematics Practice Test 1

Name: Student Number:

  1. Write the negation of each statement in good English. Do not write “It is not true that...”

a. Some bananas are yellow. No bananas are yellow

b. All integers ending in the digit 7 are odd. There are some even integers ending in the digit 7

c. No tests are easy. Some tests are easy

d. Roses are red and violets are blue. Some roses are not red, or some violets are not blue

e. Some skiers do not speak Spanish. All skiers speak Spanish

  1. Let predicate T (x, y) denote that student x is taking course y, and predicate P (x, y) denote that student x has passed course y. Write each of the following statements in good English. Do not use variables in your answers.

a. ¬P (John, CSE 131) John has not passed CSE 131

b. ∃y∀xT (x, y) There is a course that all students have taken

c. ∀x∃yT (x, y) Each student has taken some course

  1. Let p, q, and r denote propositional variables. Write a proposition that is true when p and q are true and r is false, but false otherwise. You may use any or all of the logical operators considered in class. p ∧ q ∧ ¬r Show that your proposition gives the desired result by writing a truth table.

p q r p ∧ q ∧ ¬r F F F F F F T F F T F F F T T F T F F F T F T F T T F T T T T F

  1. Use the rules of propositional equivalence to prove that

(q ∧ (p → ¬q)) → ¬p

(Do not use a truth table.)

(q ∧ (p → ¬q)) → ¬p ≡ (q ∧ (¬p ∨ ¬q)) → ¬p (Conditional-disjunction equivalence: p → q ≡ ¬p ∨ q) ≡ ((q ∧ ¬p) ∨ (q ∧ ¬q)) → ¬p (Distributivity Law) ≡ ((q ∧ ¬p) ∨ F) → ¬p (Negation Law) ≡ (q ∧ ¬p) → ¬p (Identity Law) ≡ ¬(q ∧ ¬p) ∨ ¬p (Conditional-disjunction equivalence) ≡ (¬q ∨ ¬¬p) ∨ ¬p (DeMorgan’s Law) ≡ (¬q ∨ p) ∨ ¬p (Double negation Law) ≡ ¬q ∨ (p ∨ ¬p) (Associative Law) ≡ ¬q ∨ T (Negation Law) ≡ T (Domination Law)