Curioustab

Home » Digital Electronics » Boolean Algebra and Logic Simplification

When are the inputs to a NAND gate, according to De Morgan's theorem, the output expression could be:

X = A + B
X = (A)(B)

Correct Answer: X = A + B

← Previous Question Next Question→

More Questions from Boolean Algebra and Logic Simplification

Applying the distributive law to the expression , we get ________.
Applying DeMorgan's theorem to the expression , we get ________.
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 truth table for the SOP expression has how many input combinations?
AC + ABC = AC
Mapping the SOP expression , we get ________.
Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.
Mapping the standard SOP expression , we get
Determine the binary values of the variables for which the following standard POS expression is equal to 0.
Which of the following combinations cannot be combined into K-map groups?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion