Recall the discussion of the completeness of the NAND and NOR functions.
A. Referring to figure 3.2, identify which other two-argument Boolean functions are complete in the same sense.
B. Give a definition of NAND in terns of each of the other complete functions. Do the same for NOR.
C. Which of the sixteen two-input Boolean functions are complete assuming that constants are not available?
D. If you had to build a computer out of just one type of gate, would the NAND gate be preferred over the AND gate? Why or why not?
