Sample Test 2 C421 Spring 2002  Name ________________________

Closed Book, Closed Notes, Closed Neighbor, Closed Computer, 1 8.5 x 11” crib sheet

20 points per problem                                                                                                                                               

1. Minimize the function Z = AB + B’CD + ABCD (don’t cares = BC) using the Quine-McCluskey Method. Show ALL Work.

b. Identify all Prime Implicants.

c. Identify any essential Prime Implicants.

d. Is this THE minimum solution?.

e. Verify your solution using a K-map.

2. Implement the following function Z = A + B’D + CD using:

a. A 16:1 Multiplexer

b. An 8:1 Multiplexer

c. A 4:16 Decoder and the MINIMUM number of additional logic gates.

3. Prove that a 2:1 Multiplexer is universal.

4. Describe a 8:1 Multiplexer in VHDL.

5. How many 2:1 Decoders would you need to make a 64:1 Decoder? Draw your solution.