Karnaugh Map

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

The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1.

• Impact

• Non Impact

• Force

• Complementarity

Each product term of a group, w’.x.y’ and w.y, represents the ____________in that group.

• Input

• POS

• Sum-of-Minterms

• Sum of Maxterms

The prime implicant which has at least one element that is not present in any other implicant is known as ___________

• Essential Prime Implicant

• Implicant

• Complement

• Prime Complement

Product-of-Sums expressions can be implemented using __________

• 2-level OR-AND logic circuits

• 2-level NOR logic circuits

• 2-level XOR logic circuits

• Both 2-level OR-AND and NOR logic circuits

Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given ___________

• Function

• Value

• Set

• Word

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

• Registers

• Terms

• K-maps

• Latches

It should be kept in mind that don’t care terms should be used along with the terms that are present in ___________

• Minterms

• Expressions

• K-Map

• Latches

Using the transformation method you can realize any POS realization of OR-AND with only.

• XOR

• NAND

• AND

• NOR