IndiaBIX

Digital Electronics - Boolean Algebra and Logic Simplification

Exercise : Boolean Algebra and Logic Simplification - General Questions
16.
What is the primary motivation for using Boolean algebra to simplify logic expressions?
It may make it easier to understand the overall function of the circuit.
It may reduce the number of gates.
It may reduce the number of inputs required.
all of the above
Answer: Option
Explanation:
No answer description is available. Let's discuss.
17.
How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)
1
2
4
5
Answer: Option
Explanation:
No answer description is available. Let's discuss.
18.
AC + ABC = AC
True
False
Answer: Option
Explanation:
No answer description is available. Let's discuss.
19.
When are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be:
X = A + B
X = (A)(B)
Answer: Option
Explanation:
No answer description is available. Let's discuss.
20.
Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]?
associative
commutative
Boolean
distributive
Answer: Option
Explanation:
No answer description is available. Let's discuss.
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers