ECE 1315 UMD – Edited Mar 7, 2011 3/7/2011

Name: _________________________
ECE 1315 – DIGITAL SYSTEMS

Exam I – 100 Points

Show Work for Partial Credit

1. (15 Pts) Given the following truth table:

X Y Z | F
--------------------
0 0 0 | 0
0 0 1 | 1
0 1 0 | 1
0 1 1 | 0
1 0 0 | 1
1 0 1 | 0
1 1 0 | 0
1 1 1 | 1

a) Write all the minterms in algebraic form

b) Write all the Maxterms in algebraic form
c) Write the minimal POS or the minimal SOP boolean switching expression for this function
d) If this function was implemented using only gates from the following set: {And-2, Or-2, Nand-2, XOR-2}, draw
the gate circuit that would use the fewest gates.

S.Norr -1-
ECE 1315 UMD – Edited Mar 7, 2011 3/7/2011

2. (20 Pts) Minimize the following expression by algebraic manipulation:

F(W,X,Y,Z) = (WX + Z’)(Y’ + Z) + W’(X+Y’)

a) Minimize to smallest SOP form

b) Minimize to smallest POS form

3. (20 Pts) Minimize the following expression by algebraic manipulation:

F(A,B,C,D) ={ A’B’C’D + A’B’CD + A’BC’D’ + A’BCD’ + AB’C’D + AB’CD + ABC’D’ + ABCD’ }

S.Norr -2-
ECE 1315 UMD – Edited Mar 7, 2011 3/7/2011
4. (25 Pts) For the gate network shown below:

a) Write the boolean switching expression for the output, f, of this network as shown.
b) Algebraically simplify the expression to its minimal form.
c) Draw the gate network for the minimal expression.

S.Norr -3-
ECE 1315 UMD – Edited Mar 7, 2011 3/7/2011
5. (10 Pts) A combinational system has two inputs, X (a decimal digit from 0 to 9) and Y (either 0 or 1). The output Z is
equal to X+5 of Y=0, and X+10 if Y=1.
a) Write the hi-level description for this system, assuming that the system will be implemented using bit vectors, not
decimals.
b) How many rows will a truth table have for this system? How many will be ‘don’t care’ rows?

6. (10 Pts) The NAND gate is a universal set unto itself. If a NAND gate can be wired as shown to produce a NOT gate,

show how three 2-input NAND gates may be wired to produce a 2-input OR gate.

S.Norr -4-