Font size
WorksheetsKarnaugh Mapping
Total questions: 18
Worksheet time: 14mins
Who invented the K-Map?
(a)
What does a Karnaugh Map do to Boolean Expressions?
Simplify
Process
Translate
Complicate
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
Karnaugh Maps are useful for Boolean Expressions of how many variables?
Between 2 and 6
1 variable
1 or 2 variables
More than 6
Don’t care conditions can be used for simplifying Boolean expressions in (a)
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
Using Karnaugh Maps, find the logical expression.
Assume blanks are zeroes
ABC + ABC
A'B'C + ABC'
A'B'C + ABC
A'BC + ABC
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
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
Using Karnaugh Maps, find the logical expression.
Assume blanks are zeroes.
AB'
AB
A'B'
A'B
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
There are (a) cells in a 4-variable K-map.
Using Karnaugh Maps, find the logical expression.
Assume blanks are zeroes
(a)
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
A Karnaugh map (K-map) is an abstract form of (a) diagram organized as a matrix of squares.
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
The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1.
Impact
Non Impact
Force
Comolementarity
There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and (a) operations.
