# Digital Electronics - Boolean Algebra and Logic Simplification

### Exercise :: Boolean Algebra and Logic Simplification - General Questions

21.

Applying DeMorgan's theorem to the expression , we get ________

 A. B. C. D.

Explanation:

No answer description available for this question. Let us discuss.

22.

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

 A. 2s B. 1, 2, 4, 8, etc. C. 4s D. 3s

Explanation:

No answer description available for this question. Let us discuss.

23.

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

 A. F = ABD + ABC + CD B. F = CD + AD C. F = BC + AB D. F = AC + AD

Explanation:

No answer description available for this question. Let us discuss.

24.

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.

 A. don't care, 1s, 0s, simplify B. spurious, ANDs, ORs, eliminate C. duplicate, 1s, 0s, verify D. spurious, 1s, 0s, simplify

Explanation:

No answer description available for this question. Let us discuss.

25.

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

 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