Fall 2010 Name:______________________________

I.D.:_______________________________

EE 2301 INTRODUCTION TO DIGITAL SYSTEMS DESIGN

Test #1

Problem 1 _______________ (15 pts.)

Problem 2 _______________ (20 pts.)

Problem 3 _______________ (15 pts.)

Problem 4 _______________ (20 pts.)

Problem 5 _______________ (20 pts.)

Total _______________ (90 pts.)

* Remember to put your name and I.D.# on this exam.

** Show all your work (except for multiple choice problems).

* Check that you have completed all parts of all five problems. Do not spend all your time
on one problem, since time is limited.

** Write solutions only on the front side of the exam sheets and only on the page associated
with the problem. Solutions given in other locations will not be graded. The last page is
intentionally left blank – you can use it as scratch paper and can tear it off.

*** Read and solve each problem carefully, since partial credit will be limited!
 2

Problem 1

Answer the following statements with T(rue) or F(alse) only.

(do not guess: points may be deducted for the wrong answers. If you do not know the
answer, leave it blank)

(a) ____ finite decimal fraction can be always converted to finite binary fraction

(b) ____ finite hexadecimal fraction can be always converted to finite binary fraction

(c) ____ a 4-bit word can represent 16 different integer numbers, using 1’s complement
representation

(d) ____ a 4-bit word can represent 16 different integer numbers, using 2’s complement
representation

(e) ____ (George Boole invented Boolean algebra) NOR (sweet corn is better than sex)

(f) ____ any Boolean function of 4 variables can be implemented using a 4-to-1
multiplexer and no additional gates

(g) ____ any Boolean function of 4 variables can be implemented using a 4-to-16 decoder
and no additional gates

(h) ____ the (logical) product of all maxterms and minterms of a Boolean function equals 1

(i) ____ any Boolean function can be implemented using only NOR gates

(k) ____ a 2-to-4 decoder with enable input can implement a 1-to-4 demultiplexer
 3

Problem 2

(a) Show the switching network (network of switches) implementing the Boolean function

f(a,b,c) = [(a’+b)c] + [a(b+c’)]

(b) Show the SOP and POS form of the Boolean function directly from the switching network
obtained in (a), by enumerating all input-output paths (‘tie sets’) for the SOP form, and showing
all ‘cut sets’ for the POS form

(c) Find min POS forms of the function given in (a) using algebraic manipulations. Also show
the minimum two-level NOR gates network implementing this function.
 4

Problem 3

Shown below is the prime implicant chart for a completely specified 4-variable Boolean
function f(w,x,y,z).
a) Algebraically express f as a product-of-maxterms.
b) Give algebraic expressions for the prime implicants labeled A, C and D in the table.
c) Find all essential prime implicants and show a minimal sum-of-products expression
for f .

0 4 5 6 7 8 9 10 11 13 14 15
A X X
B X X X X
C X X X X
D X X X X
E X X X
F X X X X
G X X
H X X X X
 5

Problem 4
(a) Using algebraic manipulations, show that the following two circuits realize the same function,
i.e., show that f =G.
(i)
x

m
f

(ii)
X
Y

(b) Assuming the circuit in Fig. (ii) above has a logical stuck-at-1 fault on the output line
G, find all tests to detect this fault.

(c) Detect all static hazards for the circuit in Fig. (ii) above.
 6

Problem 5

(a) Consider a simple comparator circuit that compares two binary inputs, A and B, and generates
a binary output Y, such that Y=1 if and only if these inputs are equal (i.e. A=B). Implement this
comparator using a 4-to-1 multiplexer.

(b) Comparator of two 4-bit numbers A = A3 A2 A1 A0 and B = B3 B2 B1 B0 has 8 binary inputs,

and an output Y such that Y=1 if and only if these numbers are equal (A = B). Implement this
comparator using four 4-to-1 multiplexers and a single AND gate.