edited by
316 views
0 votes
0 votes

The logic expression $(\bar{P} \wedge Q) \vee(P \wedge \bar{Q}) \vee(P \wedge Q)$ is equivalent to

  1. $\bar{P} \vee Q$,
  2. $P \vee \bar{Q}$
  3. $P \vee Q$
  4. $\bar{P} \vee \bar{Q}$
edited by

1 Answer

1 votes
1 votes
In mathematical logic $\wedge$ represents an AND,$\vee$ represents an OR logic, based on that we can rewrite the given expression:

$(\bar P \wedge Q)\vee(P\wedge \bar Q\vee(P\wedge Q))$

$\implies\bar PQ+P\bar Q+PQ$
$\implies Q(P+\bar P)+P\bar Q$
$\implies Q+P\bar Q$
$\implies(P+Q)(Q+\bar Q)$ (Apply distributive law, $\because A+\bar A=1$)
$\implies (P+Q)\equiv P\vee Q$

Option (C) is correct.

Related questions

1 votes
1 votes
0 answers
2
admin asked Oct 23, 2022
949 views
Using $\text{'RSA'}$ algorithm, if $p=13, q=5$ and $e=7$. the value of $d$ and cipher value of $'6'$ with $(e, n)$ key are$7, 4$$7, 1$$7, 46$$55,1$
0 votes
0 votes
1 answer
4
admin asked Oct 23, 2022
322 views
Size and complexity are a part ofPeople MetricsProject MetricsProcess MetricsProduct Metrics