Scribd
Upload
117 views

Sp19 HW1

This homework assignment is due on Thursday, January 31st at 12:00pm and contains 11 questions worth a total of 110 points. The questions cover topics like writing compound propositions, truth tables, Boolean logic, quantifiers, and translating statements to logical expressions. Students are instructed to show their work to allow for possible partial credit.

Uploaded by

Srini Laliwala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
117 views

Sp19 HW1

This homework assignment is due on Thursday, January 31st at 12:00pm and contains 11 questions worth a total of 110 points. The questions cover topics like writing compound propositions, truth tables, Boolean logic, quantifiers, and translating statements to logical expressions. Students are instructed to show their work to allow for possible partial credit.

Uploaded by

Srini Laliwala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Homework 1

Due Thursday January 31: on CourseSite, at 12:00pm


CSE 140: Spring 2019
You must complete all questions. The point total is 110. However, you can only earn up to 100 points.
Important: Where appropriate, please show details of your work to allow for possible partial credit.

1. (10 points) Let p, q, and r be the propositions


p: You get an A on the final exam.
q: You do every exercise in the book.
r: You get an A in this class.

Write the following compound propositions using p, q, and r and logical connectives (including nega-
tions).

(a) You get an A in this class, but you do not do every exercise in the book.
(b) You get an A on the final, you do every exercise in the book, and you get an A in this class.
(c) To get an A in this class, it is necessary for you to get an A on the final.
(d) You get an A on the final, but you don’t do every exercise in the book; nevertheless, you get an
A in this class.
(e) Getting an A on the final and doing every exercise in the book is sufficient for getting an A in
this class.
(f) You will get an A in this class if and only if you either do every exercise in this book or you get
an A on the final.

2. (10 points) Write each of these statements in the form “if p, then q” in English. Hint: Refer to the list
of common ways to express conditional statements provided in this section.

(a) I will remember to send you the address only if you send me an email.
(b) To be considered a Pennsylvanian, it is sufficient that you were born in Pennsylvania.
(c) If you keep your textbook, it will be a useful reference in your future courses.
(d) The Flyers will win the Stanley Cup if their goalie plays well.
(e) That you get the job implies that you had the best credentials.
(f) The beach erodes whenever there is a storm.
(g) It is necessary to have a valid password to log on to the server.
(h) You will reach the summit unless you begin your climb too late.

1
3. (10 points) Construct a truth table for each of these compound propositions.

(a) p → ¬p (d) (p ∧ q) → (p ∨ q)
(b) p ↔ ¬p (e) (q → ¬p) ↔ (p ↔ q)
(c) p ⊕ (p ∨ q) (f) (p ↔ q) ⊕ (p ↔ ¬q)

4. (10 points) Evaluate each of these expressions.


(a) 1 1000 ∧ (0 1011 ∨ 1 1011)
(b) (0 1111 ∧ 1 0101) ∨ 0 1000
(c) (0 1010 ⊕ 1 1011) ⊕ 0 1000
(d) (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011)
5. (10 points) Use a truth table to verify the DeMorgan law:
¬(p ∧ q) ≡ ¬p ∨ ¬q.
6. (10 points) Use DeMorgan’s laws to find the negation of each of the following statements.
(a) Kwame will take a job in industry or go to graduate school.
(b) Yoshiko knows Java and calculus.
(c) Rita is young and smart.
(d) James will move to Oregon or Washington.
7. (10 points) Show that (p → q) ∨ (p → r) and p → (q ∨ r) are logically equivalent.
8. (10 points) Let P (x) be the statement “the word x contains the letter a.” What are these truth values?

(a) P (orange) (c) P (true)


(b) P (lemon) (d) P (false)

9. (10 points) Let N (x) be the statement “x has visited North Dakota,” where the domain consists of the
students in your school. Express each of these quantifications in English.

(a) ∃xN (x) (c) ¬∃xN (x) (e) ¬∀xN (x)


(b) ∀xN (x) (d) ∃x¬N (x) (f) ∀x¬N (x)

10. (10 points) Suppose the domain of the propositional function P (x) consists of the integers −2, −1, 0, 1, 2.
Write out each of these propositions using disjunctions, conjunctions, and negations.

(a) ∃xP (x) (c) ∃x¬P (x) (e) ¬∃xP (x)


(b) ∀xP (x) (d) ∀x¬P (x) (f) ¬∀xP (x)

11. (10 points) Translate in two ways each of these statements into logical expressions using predicates,
quantifiers, and logical connectives. First, let the domain consists of the students in your class and
second, let it consist of all people.
(a) Everyone in your class has a cellular phone.
(b) Somebody in your class has seen a foreign movie.
(c) There is a person in your class who cannot swim.
(d) All students in your class can solve quadratic equations.
(e) Some student in your class does not want to be rich.

You might also like