Problem Set #1

Given the function: F = A + BC + AB + C
Answer the following:
  1. Draw a gate diagram of F.
  2. Give the truth table of F.
  3. Prove that F is or is not equivalent to G = A + B + C.
  4. Use deMorgan's Laws to remove all NAND and NOR from F. Write your result algebraically.
  5. Which is more likely to be capable of implementing an arbitrary function: a pile of AND gates or a pile of NOR gates? Explain.
  6. Rewrite F as a sum of products with minterms.
  7. Use Karnaugh maps to simplify F.