Karnaugh Mapping - Assessment

1.

Fill in the Blank

45 sec

1 pt

Who invented the K-Map?

2.

Multiple Choice

30 sec

1 pt

What does a Karnaugh Map do to Boolean Expressions?

Simplify

Process

Translate

Complicate

3.

Multiple Choice

30 sec

1 pt

When ordering binary numbers for a Karnaugh Map, which of the following is the correct sequence?

00, 01, 11, 10

00, 11, 10, 01

11, 10, 01, 00

00, 01, 10, 11

4.

Multiple Choice

30 sec

1 pt

Karnaugh Maps are useful for Boolean Expressions of how many variables?

Between 2 and 6

1 variable

1 or 2 variables

More than 6

5.

Fill in the Blank

45 sec

1 pt

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

6.

Multiple Choice

45 sec

1 pt

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

7.

Multiple Choice

30 sec

1 pt

Using Karnaugh Maps, find the logical expression.

Assume blanks are zeroes

ABC + ABC

A'B'C + ABC'

A'B'C + ABC

A'BC + ABC

8.

Multiple Choice

30 sec

1 pt

When designing a circuit to emulate a truth table, both Product-of-Sums (POS) expressions and Sum-of-Products (SOP) expressions can be derived from?

K-Map

NAND Gate

NOR Gate

X-NOR Gate

9.

Multiple Choice

2 mins

1 pt

Use Karnaugh map to find the simplified expression of the function: F = x’yz + xy + xy’z’.

xz’+y’z’

xy’z+xy

y’z+x’y+z

yz+xy+xy’z

10.

Multiple Choice

30 sec

1 pt

Using Karnaugh Maps, find the logical expression.

Assume blanks are zeroes.

AB'

AB

A'B'

A'B

11.

Multiple Choice

30 sec

1 pt

Simplification of the Boolean expression for a logic circuit would result in a circuit that contains: 

Fewer gates but more connections

Fewer gates and connections

Fewer gates only

Fewer connections only

12.

Fill in the Blank

45 sec

1 pt

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

13.

Fill in the Blank

1 min

1 pt

Using Karnaugh Maps, find the logical expression.

Assume blanks are zeroes

14.

Multiple Choice

30 sec

1 pt

What is the logical expression from this K-map?

A'B + AB + C'D' + CD

AB + AB + CD + CD

AB + AB + C'D + CD

A'B' + AB + C'D + CD

15.

Fill in the Blank

45 sec

1 pt

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

16.

Multiple Choice

1 min

1 pt

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

17.

Multiple Choice

45 sec

1 pt

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

Impact

Non Impact

Force

Comolementarity

18.

Fill in the Blank

1 min

1 pt

There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and _____ operations.

Explore this activity with a free account