Exercise 2: Truth Tables of Compound Propositions and Bit Operations

Mance, Andy
MS101 IT1-1 MW

Answer the following exercises.

I. Construct a truth table for each of these compound propositions.
a) p → (¬q ∨ r)

4 2 1 p q r !q !q V r p → (¬q ∨ r)

0 0 0 0 F F T T T T
0 0 1 1 F F F T T T
0 1 0 2 F T T F T T
0 1 1 3 F T F F F T
1 0 0 4 T F T T T T
1 0 1 5 T F F T T T
1 1 0 6 T T T F T T
1 1 1 7 T T F F F F
CONTINGENCY

b) ¬p → (q → r)

4 2 1 p q r !p q→r ¬p → (q → r)

0 0 0 0 F F F T T T
0 0 1 1 F F T T T T
0 1 0 2 F T F T F F
0 1 1 3 F T T T T T
1 0 0 4 T F F F T T
1 0 1 5 T F T F T T
1 1 0 6 T T F F F T
1 1 1 7 T T T F T T

CONTINGENCY
c) (p → q) ∨ (¬p → r)

4 2 1 p q r !p p→q ¬p → r (p → q) ∨ (¬p → r)

0 0 0 0 F F F T T F T
0 0 1 1 F F T T T T T
0 1 0 2 F T F T T F T
0 1 1 3 F T T T T T T
1 0 0 4 T F F F F T T
1 0 1 5 T F T F F T T
1 1 0 6 T T F F T T T
1 1 1 7 T T T F T T T

TAUTOLOGY

d) (p → q) ∧ (¬p → r)

4 2 1 p q r !p p→q ¬p → r (p → q) ∧ (¬p → r)

0 0 0 0 F F F T T F F
0 0 1 1 F F T T T T T
0 1 0 2 F T F T T F F
0 1 1 3 F T T T T T T
1 0 0 4 T F F F F T F
1 0 1 5 T F T F F T F
1 1 0 6 T T F F T T T
1 1 1 7 T T T F T T T

CONTINGENCY
e) (p ↔ q) ∨ (¬q ↔ r)

4 2 1 p q r !q (p ↔ q) (¬q ↔ r) (p ↔ q) ∨ (¬q ↔ r)

0 0 0 0 F F F T T F F
0 0 1 1 F F T T T T T
0 1 0 2 F T F F F T F
0 1 1 3 F T T F F F F
1 0 0 4 T F F T F F F
1 0 1 5 T F T T F T F
1 1 0 6 T T F F T T T
1 1 1 7 T T T F T F F

CONTINGENCY

f) (¬p ↔ ¬q) ↔ (q ↔ r)

4 2 1 p q r !p !q (¬p ↔ ¬q) (q ↔ r) (¬p ↔ ¬q) ↔ (q ↔ r)

0 0 0 0 F F F T T T T T
0 0 1 1 F F T T T T F F
0 1 0 2 F T F T F F F T
0 1 1 3 F T T T F F T F
1 0 0 4 T F F F T F T F
1 0 1 5 T F T F T F F T
1 1 0 6 T T F F F T F F
1 1 1 7 T T T F F T F F

CONTINGENCY
II. Find the bitwise OR, bitwise AND, and bitwise XOR of each of these pairs of bit strings.
a) 101 1110, 010 0001

101 1110
010 0001

OR 111 1111

AND 000 0000

XOR 111 1111

b) 1111 0000, 1010 1010

1111 0000
1010 1010

OR 1111 1010

AND 1010 0000

XOR 0111 1010

c) 00 0111 0001, 10 0100 1000

00 0111 0001
10 0100 1000

OR 10 0111 1001

AND 00 0100 0000

XO 10 0011 1001
R

d) 11 1111 1111, 00 0000 0000

11 1111 1111
00 0000 0000

OR 11 1111 1111

AND 00 0000 0000

XOR 11 1111 1111