August
1999 QUESTION 4 Total Marks: 20 Marks |
Click here to access other
questions
Click to access |
(a) | Give the truth table for a half-adder.
|
[1] | |||||||||||||||
(b) | Express the carry and sum terms of a
half-adder using NAND and NOT operations only.
|
[2] | |||||||||||||||
(c) | Hence draw a circuit for a half-adder using
only NAND gates.
|
[4] | |||||||||||||||
(d) | Show how to construct a full-adder using two
half-adders and an OR gate.
|
[3] | |||||||||||||||
(e) | Here is the truth table for a 4-to-1
multiplexor.
(Thus, when S1 = 0 and S0 = 0, the value of B is the same as that of input A0, and so on.) Explain how such a multiplexor can be used to implement an arbitrary 3-input, 1-output circuit.
|
[4] | |||||||||||||||
(f) | Hence show how to implement a full-adder using
two 4-to-1 multiplexors.
|
[6] |