The systematic reduction of logic circuits is accomplished by: symbolic reductio

CuriousTab

CuriousTab

Home Aptitude

Discussion

Home ‣ Electronics ‣ Logic Circuit Simplification Comments

Question
The systematic reduction of logic circuits is accomplished by:
Options
A. symbolic reduction
B. TTL logic
C. using Boolean algebra
D. using a truth table

Correct Answer

using Boolean algebra

Logic Circuit Simplification problems

Search Results

1. Which statement below best describes a Karnaugh map?
Options
A. It is simply a rearranged truth table.
B. The Karnaugh map eliminates the need for using NAND and NOR gates.
C. Variable complements can be eliminated by using Karnaugh maps.
D. A Karnaugh map can be used to replace Boolean rules.

4. What is the difference between binary coding and binary coded decimal?
Options
A. Binary coding is pure binary.
B. BCD is pure binary.
C. Binary coding has a decimal format.
D. BCD has no decimal format.

9. One of DeMorgan's theorems states that . Simply stated, this means that logically there is no difference between:
Options
A. a NAND gate and an AND gate with a bubbled output
B. a NOR gate and an AND gate with a bubbled output
C. a NOR gate and a NAND gate with a bubbled output
D. a NAND gate and an OR gate with a bubbled output

10. Which of the examples below expresses the distributive law of Boolean algebra?
Options
A. A ? (B ? C) = (A ? B) + C
B. A + (B + C) = (A ? B) + (A ? C)
C. A ? (B + C) = (A ? B) + (A ? C)
D. (A + B) + C = A + (B + C)

Comments

More in Electronics: