De Morgan's Theorem in Boolean Logic

Select Most Suitable Explanation Regarding De Morgan's Theorem (select two)

• DeMorgan’s Theorems are two additional

  simplification techniques that can be used to

  simplify Boolean expressions.

• DeMorgan’s Theorem is a Mathematical Expression.

• DeMorgan’s Theorems can be used to

  simplify Boolean expressions.

• DeMorgan’s Theorem is a Karnaugh Map.

Select the De Morgan's Theorems

• 
• 
• 
• 

What is the correct selection for this given Boolean expression.

Which option explains the names of the each logic gate in this Gate symbols?

• OR, AND, NOR, NAND, XAND, XOR and NOT

• AND, OR, XNAND, NOR, XOR, XNOR and XNOT

• AND, OR, NAND, NOR, XOR, XNOR and NOT

• AND, OR, BOR, NAND, XAND, XOR and NOT

Consider the inputs of the each gates in the given diagram are X and Y. Which set of Boolean expressions describes the given diagram inorderly?

Which one is not a Karnaugh map rule?

• Only power of 2 number of cells in each group.

• No diagonals are allowed.

• No zeros allowed in a group.

• zeros allowed in a group.

Which option is correct regarding Karnaugh map rule?

• Every logic “1” must be in at least one group.

• Overlapping is allowed.

• Wrap around is allowed.

• Fewest number of groups as much as possible.

• All are correct

Select all the choices that explains a KARNAUGH MAP?

• Karnaugh map is used to simplify Boolean logic expressions.

• It tells you what output your circuit will have given your inputs.

• Karnaugh map combines illustrations with common factors and therefore eliminates unwanted variables.

• It is a software tool for circuit building.

Which one is correct?

• 
• 
• 
•