Q.1.

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

Q.2.

The Boolean expression C + CD is equal to ________.

Q.3.

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

Q.4.

In Boolean algebra, A + 1 = 1.

Q.5.

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

Q.6.

Which of the following is true for a 5-variable Karnaugh map?

Q.7.

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

Q.8.

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

Q.9.

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

Q.10.

When four 1s are taken as a group on a Karnaugh map, the number of variables eliminated from the output expression is ________.

Q.11.

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

Q.12.

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

Q.13.

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

Q.14.

In Boolean algebra, the word "literal" means ________.

Q.15.

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

Q.16.

In Boolean algebra, the word "literal" means ________.

Q.17.

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

Q.18.

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

Q.19.

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.

Q.20.

The systematic reduction of logic circuits is accomplished by: