Lesson 7 Boolean algebra – Minimization of Boolean expression using K-Maps

Welcome to your Lesson 7 Boolean algebra - Minimization of Boolean expression using K-Maps

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

a) Venn Diagram

b) Cycle Diagram

c) Block diagram

d) Triangular Diagram

2. There are %BLANK% cells in a 4-variable K-map.

a) 12

b) 16

c) 18

d) 8

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

a) Impact

b) Non-Impact

c) Force

d) Complementarity

4. Each product term of a group, w’.x.y’ and w.y, represents the %BLANK%
in that group.

a) Input

b) POS

c) Sum-of-Minterms

d) Sum of Maxterms

5. The prime implicant which has at least one element that is not present in any
other implicant is known as %BLANK%

a) Essential Prime Implicant

b) Implicant

c) Complement

d) Prime Complement

6. Product-of-Sums expressions can be implemented using %BLANK%

a) 2-level OR-AND logic circuits

b) 2-level NOR logic circuits

c) 2-level XOR logic circuits

d) Both 2-level OR-AND and NOR logic circuits

7. Each group of adjacent Minterms (group size in powers of twos) corresponds
to a possible product term of the given %BLANK%.

a) Function

b) Value

c) Set

d) Word

8.Don’t care conditions can be used for simplifying Boolean expressions in
%BLANK% .

a) Registers

b) Terms

c) K-maps

d) Latches

9. It should be kept in mind that don’t care terms should be used along with the
terms that are present in %BLANK%.

a) Minterms

b) Expressions

c) K-Map

d) Latches

10. Entries known as %BLANK% mapping.

a) Diagonal

b) Straight

c) K

d) Boolean

Time is Up!