Boolean Algebra

X . X

• 0
• 1
• X
• __
   X

__     __
A  .   B
is the same as

• _______
  A + B
• A . B
• B . A
• ______
  A . B

Tags

CCSS.7.EE.A.1

A . ( B + C )
is the same as

• ___________
  A + B + C
• ( A + B ) ( A + C)
• A . B . C
• ( A . B ) + ( A . C )

Tags

CCSS.6.EE.A.3

Which law is this an example of:

A(B+C) = (A.B)+(A.C)

A+(B.C) = (A+B).(A+C)

• Associative

• Commutative

• Absorption

• Distributive

Tags

CCSS.6.EE.A.3

How many different combinations of 1 and 0 are possible with 3 bits?

• 2

• 4

• 6

• 8

What is the Logic Expression for this circuit?

• Z = NOT (A AND B)

• Z = NOT (A OR B)

• Z = (NOT A) AND B

• Z = (NOT A) OR B

What kind of gate does this Truth Table represent?

• NOR
• NOT
• OR
• XOR

(C AND D) OR (NOT(A OR B)) = Q, If A=1, B=1, C=0 and D=1, what does Q equal?

• 0
• 1

Which of the following two input logic functions can act as a Universal gate?

• A ⊕ B

• AB

• (A+B)’

• None of the above

A NAND gate is called a universal logic element because

• All digital computers use NAND gates

• All the minimisation techniques are applicable for optimum NAND gate realisation

• Everybody use this gate

• Any logic function can be realized by NAND gates alone