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 ________
Answer: Option
Explanation:
No answer description is available. Let's discuss.

22.
When grouping cells within a K-map, the cells must be combined in groups of ________.
2s
1, 2, 4, 8, etc.
4s
3s
Answer: Option
Explanation:
No answer description is available. Let's discuss.

23.
Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.
F = ABD + ABC + CD
F = CD + AD
F = BC + AB
F = AC + AD
Answer: Option
Explanation:
No answer description is available. Let's 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.
don't care, 1s, 0s, simplify
spurious, ANDs, ORs, eliminate
duplicate, 1s, 0s, verify
spurious, 1s, 0s, simplify
Answer: Option
Explanation:
No answer description is available. Let's discuss.

25.
The NAND or NOR gates are referred to as "universal" gates because either:
can be found in almost all digital circuits
can be used to build all the other types of gates
are used in all countries of the world
were the first gates to be integrated
Answer: Option
Explanation:
No answer description is available. Let's discuss.