Digital Electronics Boolean Algebra and Logic Simplification Online Test

Which of the following expressions is in the sum-of-products (SOP) form?

The commutative law of Boolean addition states that A + B = A × B.

The systematic reduction of logic circuits is accomplished by:

An AND gate with schematic “bubbles” on its inputs performs the same function as a(n)________ gate.

How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)

What is the primary motivation for using Boolean algebra to simplify logic expressions?

How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)

AC + ABC = AC

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]?

When grouping cells within a K-map, the cells must be combined in groups of ________.

Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.

The NAND or NOR gates are referred to as “universal” gates because either:

Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.

A Karnaugh map is a systematic way of reducing which type of expression?

Which statement below best describes a Karnaugh map?

Which of the examples below expresses the distributive law of Boolean algebra?

Which of the following is an important feature of the sum-of-products (SOP) form of expression?

An OR gate with schematic “bubbles” on its inputs performs the same functions as a(n)________ gate.

Which of the examples below expresses the commutative law of multiplication?

The expression W(X + YZ) can be converted to SOP form by applying which law?

The commutative law of addition and multiplication indicates that:

Which of the following combinations cannot be combined into K-map groups?

A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0.

The OR function is Boolean multiplication and the AND function is Boolean addition.

In Boolean algebra, A + 1 = 1.

The product-of-sums (POS) is basically the ORing of ANDed terms.

SOP stands for sum-of-powers.

The VHDL editor provided with a schematic editor development system will produce a file with the extension .vhd, which can be used by the simulator to test the output of the logic design.

In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.