Homework 3

Due Feb 6

1. Construct the truth table for the expression (p AND r) OR (q AND (NOT r))

2. Use truth tables to show that (p AND q AND r) OR ((NOT p) AND q AND r) is equivalent to (q AND r).

3. Find DNF and CNF Boolean Expressions that correspond to the truth table below:

p   q   r  F(p,q,r)
0   0   0    1
0   0   1    1
0   1   0    1
0   1   1    1
1   0   0    1
1   0   1    0
1   1   0    0
1   1   1    0

4. Using fuzzy logic, construct a "fuzzy truth table" for the expression in exercise #1, where each variable (p,q,r) takes on the values 0.2 and 0.8 [there are 8 combinations].