The systematic reduction of logic circuits is accomplished by: using Boolean alg

CuriousTab

CuriousTab

Home Aptitude

Discussion

Home ‣ Digital Electronics ‣ Boolean Algebra and Logic Simplification Comments

Question
The systematic reduction of logic circuits is accomplished by:
Options
A. using Boolean algebra
B. symbolic reduction
C. TTL logic
D. using a truth table

Correct Answer

using Boolean algebra

Boolean Algebra and Logic Simplification problems

Search Results

6. 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

7. 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

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

Comments

More in Digital Electronics: