Scribd
Upload
29 views4 pages

Exercisessection1 1solution

The document contains examples of logical propositions and exercises to test understanding of logical operators such as AND, OR and XOR through truth tables and bitwise operations. Propositions are identified and their truth values determined. Compound propositions are expressed in English and their truth values shown in tables. Bitwise logic is also applied to pairs of bit strings.

Uploaded by

IMRAN USSI
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
29 views4 pages

Exercisessection1 1solution

The document contains examples of logical propositions and exercises to test understanding of logical operators such as AND, OR and XOR through truth tables and bitwise operations. Propositions are identified and their truth values determined. Compound propositions are expressed in English and their truth values shown in tables. Bitwise logic is also applied to pairs of bit strings.

Uploaded by

IMRAN USSI
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/ 4

Section 1.

1
1. Which of these sentences are propositions? What are the truth values of those that are
propositions?
a) Boston is the capital of Massachusetts.
b) Miami is the capital of Florida.
c) 2 + 3 = 5.
d) 5 + 7 = 10.
e) x + 2 = 11.
f) Answer this question.

9. Let p and q be the propositions “Swimming at the New Jersey shore is allowed” and
“Sharks have been spotted near the shore,” respectively. Express each of these compound
propositions as an English sentence.
a) ¬q b) p ∧ q c) ¬p ∨ q
d) p →¬q e) ¬q → p f ) ¬p →¬q
g) p ↔¬q h) ¬p ∧ (p∨ ¬q)

31. Construct a truth table for each of these compound propositions.


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

33. Construct a truth table for each of these compound propositions.


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

43. Find the bitwise OR, bitwise AND, and bitwise XOR of each of these pairs of bit strings.
a) 101 1110, 010 0001
b) 1111 0000, 1010 1010
c) 00 0111 0001, 10 0100 1000
d) 11 1111 1111, 00 0000 0000

You might also like