CS 221 - Computer Logic and Organization
Shai Simonson 306 Stanger (508)
565-1008
Assignment
3
Due: Monday,
February 18.
Chapter 4 - Pages 138-144
Problems: 1, 3, 7, 8, 13, 14, 24, 29, 31, 32
Using one 1-2 Multiplexer (MUX) for each, show how to implement:
- an AND gate,
- and OR gate, and
- a NOT gate.
Hints: There are three inputs to a 1-2 MUX. To implement a
NOT gate, use the Boolean input for control, and hardware the data
inputs with 1 and 0. To implement an AND or an OR, use the two
boolean inputs for the two data inputs, and split one for the
control.
Chapter
5 - Page 177
Problems: 10, 12
Any function with n inputs
can be implemented with an n to 2n
multiplexer. Use a 4 to 16 multiplexer (4-16 MUX) to
implement the function in problem 10.
Hint: Use the the three Boolean inputs for control, and hardwire
the data inputs.