0000
Two type of question can ask from minimization of Boolean expression by laws
Type 1:
Question 1:
Consider a Boolean expression as below
.png)
What is minimization form of the above Boolean expression.
.png)
.png)
.png)
.png)
Solution:
.png)
We can replicate ‘xyz’ in three times which will not affect the Boolean expression because A + A + A =A.
.png)
.png)
.png)
.png)
So, option (C) is correct answer.
Question 2:
Consider a Boolean expression
.png)
What is simplification form of the given Boolean expression?
.png)
.png)
.png)
.png)
Solution:
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
.png)
So, option (A) is correct answer.
Type 2:
This type of question can ask from nested function.
Question:
.png)
.png)
.png)
.png)
.png)
Solution:
.png)
So, we can write
.png)
.png)
.png)
.png)
.png)
.png)
.png)
So, option (B) is correct answer.