The Boolean expression is logically equivalent to what single gate? NAND NOR AND

CuriousTab

CuriousTab

Home Aptitude

Discussion

Home ‣ Digital Electronics ‣ Boolean Algebra and Logic Simplification Comments

Question
The Boolean expression is logically equivalent to what single gate?
Options
A. NAND
B. NOR
C. AND
D. OR

Correct Answer

NAND

Boolean Algebra and Logic Simplification problems

Search Results

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

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

7. Which of the following is an important feature of the sum-of-products (SOP) form of expression?
Options
A. All logic circuits are reduced to nothing more than simple AND and OR gates.
B. The delay times are greatly reduced over other forms.
C. No signal must pass through more than two gates, not including inverters.
D. The maximum number of gates that any signal must pass through is reduced by a factor of two.

8. 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]?
Options
A. associative
B. commutative
C. Boolean
D. distributive

Comments

More in Digital Electronics: