Notes: For all
exercises using Boolean algebra in the following, show all the steps and state
explicitly all axioms/theorems/properties that you used.
(a) Write a truth table for the circuit.
(b) Write a logic expression for the circuit.
(a)
Truth Table;
(b)
Boolean algebra;
(c)
Its dual theorem in Boolean algebra.
(a) Draw the logic
circuit for the function f given above.
(b) Let the cost of a
logic circuit be the total number of gates plus the total number of inputs to
all gates in the circuit. What is the cost of the circuit in (a)?
(c) Simplify f using
Boolean algebra as much as possible.
(d) Draw the logic
circuit for the simplified version of f in (c).
(e) What is the cost
of the circuit in (d)?
(a) Derive the truth table for f.
(b) Write the canonical sum-of-products expression for f. Do not use the shorthand notation.
(c) Write the canonical sum-of-products expression for f in shorthand notation.
(d) Write the canonical product-of-sums expression for f. Do not use the shorthand notation.
(e) Write the canonical product-of-sums expression for f in shorthand notation.
(f) Write the canonical sum-of-products expression for f' in shorthand notation.
(g) Write the canonical product-of-sums expression for f' in shorthand notation.
(a) What is the canonical sum-of-products expression for f? Explain how you get the answer.
(b) Write a simplest sum-of-products expression (not necessary to be canonical) for f?
(c)
What is the canonical product-of-sums expression for f?
Explain how you get the answer.
(a) using only NAND gates.
(b) using only NOR gates.