How many gates would be required to implement the following Boolean expression b

CuriousTab

CuriousTab

Home Aptitude

Discussion

Home ‣ Digital Electronics ‣ Boolean Algebra and Logic Simplification Comments

Question
How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)
Options
A. 1
B. 2
C. 4
D. 5

Correct Answer

5

Boolean Algebra and Logic Simplification problems

Search Results

5. The NAND or NOR gates are referred to as "universal" gates because either:
Options
A. can be found in almost all digital circuits
B. can be used to build all the other types of gates
C. are used in all countries of the world
D. were the first gates to be integrated

8. Determine the values of A, B, C, and D that make the product term equal to 1.
Options
A. A = 0, B = 1, C = 0, D = 1
B. A = 0, B = 0, C = 0, D = 1
C. A = 1, B = 1, C = 1, D = 1
D. A = 0, B = 0, C = 1, D = 0

9. The commutative law of addition and multiplication indicates that:
Options
A. we can group variables in an AND or in an OR any way we want
B. an expression can be expanded by multiplying term by term just the same as in ordinary algebra
C. the way we OR or AND two variables is unimportant because the result is the same
D. the factoring of Boolean expressions requires the multiplication of product terms that contain like variables

Comments

More in Digital Electronics: