Multiple Choice
The K-map based Boolean reduction is based on the following Unifying Theorem: A + A' = 1.
A) impact
B) non impact
C) force
D) complementarity
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: The code where all successive numbers differ
Q3: In case of XOR/XNOR simplification we have
Q4: Canonical form is a unique way of
Q5: There are_ Minterms for 3 variables (a, b,
Q6: A variable on its own or in
Q8: It should be kept in mind that
Q9: How many two input AND gates and
Q10: Which of following are known as universal
Q11: A full adder logic circuit will have_ <br>A)two
Q12: _expressions can be implemented using either (1)