Name:     ID: 
 
Email: 

DEchapter5

True/False
Indicate whether the statement is true or false.
 

 1. 
When grouping terms for simplification, every pair of terms must have at least one term that belongs only to that pair.
 

 2. 
The number of cells in a K-map (Karnaugh map) is always a power of 2, usually 4, 8, or 16.
 

 3. 
The more digital components or gates used inside a circuit, the more difficult it might be to simplify the circuit.
 

 4. 
In a K-map, a cell should never be grouped more than once.
 

 5. 
Most digital circuits require multiple gates.
 

Multiple Choice
Identify the choice that best completes the statement or answers the question.
 

 6. 
_______ is the process of creating a logic circuit from a description such as a Boolean equation or truth table.
a.
Synthesis
c.
Simplification
b.
Sum-of-products
d.
Product-of-sums
 

 7. 
When designing a combinational logic circuit, you are ultimately looking for a:
a.
K-map simplification
c.
Boolean equation
b.
NAND function
d.
logic gate network
 

 8. 
A(n) ______ is a group of eight adjacent cells.
a.
maxterm
c.
octet
b.
quad
d.
minterm
 

 9. 
A combinational logic circuit is one in which two or more gates are connected together to combine several:
a.
levels of gating
c.
double-rail inputs
b.
Boolean inputs
d.
DeMorgan equivalents
 

 10. 
There are two ways of labeling cell coordinates: (1) numerically or (2) by:
a.
groups
c.
true and complement variables
b.
the buble-to-bubbel convention
d.
cell groups
 

 11. 
A yellow light, called the “ALERT” light, illuminates when:
a.
two or more sensors indicate an out-of-range condition
b.
no sensors are out of range
c.
no more than one sensor indicates an out-of-range condition
d.
all sensors are out of range
 

 12. 
The input to a circuit has values from _______ coded in binary format.
a.
1 to 3
c.
1 to 5
b.
0 to 3
d.
0 to 6
 

 13. 
Boolean functions are governed by:
a.
an unsimplified Boolean expression
c.
adjacent cells
b.
cell content
d.
an order of precedence
 

 14. 
When two or more gates are connected together they form a:.
a.
sequential logic
c.
logic gate network
b.
combinational logic
d.
combinatorial logic
 

 15. 
Which of the following is an example of a product term?
a.
mc015-1.jpg
c.
mc015-3.jpg
b.
 mc015-2.jpg
d.
mc015-4.jpg
 

 16. 
_______ is a sum term in a Boolean expression where all possible variables appear once, in true or complement form.
a.
Product term
c.
Sum-of-products
b.
Maxterm
d.
Product-of-sums
 

 17. 
One way to simplify a _______  is to look for pairs of product terms that are different by just one variable, then factor out what is common to the term, as you would do in other types of algebra.
a.
truth table
c.
Multisim problem
b.
word problem
d.
sum-of-products
 

 18. 
A(n) _______ is a variable around the edge of a K-map that represents an input variable (e.g., A, B, C, or D) for the Boolean expression to be simplified.
a.
cell coordinate
c.
adjacent cell
b.
quad
d.
octet
 

 19. 
The maximum simplification of a Boolean expression is achieved only if the circled groups of cells in its K-map are _______ and there are as few groups as possible.
a.
small
c.
in pairs
b.
as large as possible
d.
single
 

 20. 
_______ is the practice of drawing gates in a logic diagram so that inverting outputs connect to inverting inputs and noninverting outputs connect to noninverting inputs.
a.
Order of precedence
c.
Sequential logic
b.
Bubble-to-bubble convention
d.
Combinatorial logic
 



 
         Start Over