Sample

Problems for Exam 2

Concepts:
1.

In K-maps, why do we need to use gray code (every cell is labeled logically adjacent to the one next to it) in
labeling the rows and columns?
Answer: Because in this way we can group the adjacent cells together using the combining property.

2.

Why can we group the adjacent rows and columns in K-maps?

Answer: Because the adjacent cells has only one literal that changes, which cover both complemented form and
un-complemented form of only one variable. The two adjacent cells will have identical the rest literals.
Therefore, we can combine them together using the combining property.

3.

Why do we always need to make groups in powers of 2? An alternative question is: why cant we make a group
of 3 or 5?
Answer: Because in K-maps, each algebraic product/sum term is a combination of multiple literals. Where
each literal corresponds to a fixed input value. For the variables that do not show up in the product/sum term, it
can be either 0 or 1. The total number of option is therefore equal to 2! , where n is the number of variables that
are missing in the terms.

4.

Represent a single term in a K-map, and find the algebraic expression of a single group in a K-map.
Answer: This can be done by checking the row and column labels.

5.

Why do we need to use the largest groups that are possible in K-maps?
Answer: A larger group requires few inputs to uniquely characterize, which corresponds to few inputs in the
circuit implementation.

6.

Why do we need to consider joint/multiple function minimization?

Answer: In circuit design, in some scenarios we may need to implement multiple common related components,
by comparing the option of implementing the individual functions and implementing these functions jointly
with certain common units shared, we can reduce the overall cost, rather than individual cost.

7.

What is the major cause of glitches that make the circuit hazardous? How to fix glitches in circuit design?
Answer: In time-sensitive logic, hazards are caused due to the transient behavior of a circuit before the output of
a function is settled to a final steady-state value.
This problem can be fixed by increasing the interval (delay) between the time when inputs first begin to change
and the time when the outputs are examined by the decision-making logic, or add extra circuit components to
cover the gap that the glitches are produced.

Minimal (SOP/POS/both) Implementation:

1.

Find the minimal (or SOP) implementation of Boolean functions:

 , , , =

2,3,4,5,6,7,11,13,15

, , , =

(2,3,5,7,10,13,14,15)

Answer:

2.

Find minimum implementation of Boolean functions with dont cares:

=

Answer:

!"#$

0,1,7,15 + (5,8,9,13. )

3.

Find the minimal (or SOP) implementation multiple output Boolean functions:
, , =

Hazard Free Circuit Design

1.

(3,6,7) and , , =

0,1,3 .

Suppose = ! + , with = 0, = 1. Derive the time analysis of when changes from 1 to 0. Is

hazard free? If not, describe how to make is hazard free.

Answer:

2.

Suppose = ! + , with = = = 1. Derive the time analysis of when changes from 1 to 0. Is

hazard free? If not, describe how to make is hazard free.