Given expression is
$(x+y'+z')(x+y'+z)(x+y+z')$
Using the identity
$(x+A)(x+B)=x+AB$
First take
$(x+y'+z')(x+y'+z)$
Here,
$A=y'+z'$ and $B=y'+z$
So,
$(x+y'+z')(x+y'+z)=x+(y'+z')(y'+z)$
Now,
$(y'+z')(y'+z)=y'+z'z$
Since
$z'z=0$
So,
$(y'+z')(y'+z)=y'$
Now the expression becomes
$(x+y')(x+y+z')$
Again using the identity,
$(x+A)(x+B)=x+AB$
Here,
$A=y'$ and $B=y+z'$
So,
$(x+y')(x+y+z')=x+y'(y+z')$
$=x+y'y+y'z'$
Since
$y'y=0$
So,
$=x+y'z'$
Therefore, the simplified value is
$x+y'z'$
We have $ (A \oplus B) \land (B \to C) = (A \oplus B)\land(\lnot B \lor C)$.
Rows with output 1: $(1,0,0)$, $(1,0,1)$, $(0,1,1)$.
We are asked to find the total number of binary functions that can be defined using n Boolean variables.
For n Boolean variables, the number of possible input combinations is 2n.
Each input combination can map to either 0 or 1, so there are 2 possible outputs for each of the 2n input combinations.
Total Binary Functions = 2(2n)
The total number of binary functions that can be defined using n Boolean variables is: 2(2n)
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.