Boolean Logic

According to boolean law: A + 1 = ?

• 1

• A

• 0

• A’

DeMorgan’s theorem states that _________

• (AB)’ = A’ + B’

• (A + B)’ = A’ * B

• A’ + B’ = A’B’

• (AB)’ = A’ + B

Complement of the expression A’B + CD’ is _________

• (A’ + B)(C’ + D)

• (A + B’)(C’ + D)

• (A’ + B)(C’ + D)

• (A + B’)(C + D’)

A Karnaugh map (K-map) is an abstract form of ____________ diagram organized as a matrix of squares.

• Venn Diagram

• Cycle Diagram

• Block diagram

• Triangular Diagram

There are ______ cells in a 4-variable K-map.

• 12

• 16

• 18

• 8

Don’t care conditions can be used for simplifying Boolean expressions in ___________

• Registers

• Terms

• K-maps

• Latches

These logic gates are widely used in _______________ design and therefore are available in IC form

• Sampling

• Digital

• Analog

• Systems

A single transistor can be used to build which of the following digital logic gates?

• AND gates

• OR gates

• NOT gates

• NAND gates

How many truth table entries are necessary for a four-input circuit?

• 8

• 12

• 16

• 4

Which input values will cause an AND logic gate to produce a HIGH output?

• At least one input is HIGH

• At least one input is LOW

• All inputs are HIGH

• All inputs are LOW