Computer Systems - Tutorial 6
1. Tabulate the values of the output variables X, Y and Z in Figure Q.1 below for all possible input variables A, B and C.

Figure Q.1
2. For the circuit of question 1, find a Boolean expression for the output X in terms of the inputs A, B, and C.
3. Draw logic diagrams using AND, OR and NOT gates only, to implement the following Boolean expressions.
(a) ![]()
(b) ![]()
(c) ![]()
(d) ![]()
(e) ![]()
4. Convert the following expressions to sum-of-product form (the more usual Boolean form):-
(a) ![]()
(b) ![]()
(c) ![]()
5. Use a truth table to prove the two De Morgans theorems, namely:-
and ![]()
6. Use De Morgans theorem to re-design the circuit of Question 1 using NAND gates only.