Question
Question: The Boolean expression \[\left( {p \wedge q} \right) \vee \left( {\left( { \sim q} \right) \vee p} \...
The Boolean expression (p∧q)∨((∼q)∨p) is equivalent to
A.∼p∨q
B.∼q∨p
C.p∨q
D.(∼p)∨(∼q)
Solution
We will find the equivalent statement for the given Boolean expression with the help of truth table. The truth table that matches with that of the conditions given will be the correct option.
Complete step-by-step answer:
Let’s tabulate the expression.
p | q | p∧q | ∼q | (∼q)∨p | (p∧q)∨((∼q)∨p) |
---|---|---|---|---|---|
0 | 0 | 0 | 1 | 1 | 1 |
0 | 1 | 0 | 0 | 0 | 0 |
1 | 0 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 1 | 1 |
Now if we observe the table above we will conclude that output is the same as (∼q)∨p.
This is one of the options also.
So the correct option is B.
Note: In AND operation output is 1 only if both the inputs are 1.
In OR operation output is 1 if any of the one inputs is 1.
We also can check for other options if we want
p | q | p∧q | (∼q)∨p | (p∧q)∨((∼q)∨p) | ∼p∨q | p∨q | ∼p∨∼q |
---|---|---|---|---|---|---|---|
0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 |
0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 |
1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
So from the above table we observe that no other option matches with the given Boolean expression output.