Ithaca College Logo Ithaca College Home Blue Header

Ithaca College, Ithaca, New York


Problem Set 2

Due: 31 January 2005

  1. Given the following boolean experssion:
  2. F = A'BC' + A'BC + AB'C

    produce using algebraic manipulation:

    1. An equivalent expresssion using only NAND operations (show all your intermediate work).
    2. A logic diagram implementing the preceeding equation using only NAND gates.
    3. Implement your solution in HDL and turn it into the class drop-box on Nova.

  3. Repeat the previous question for the following equation. Use NOR operations/gates instead of NAND operations/gates. Note that you also have to implement this solution in HDL and turn your solution into the class drop-box on Nova.
  4. F = A'B'C' + A'B'C + AB'C + ABC' + ABC

  5. Using the equation from question 1, produce using gate equivalency rules:
    1. An original logic diagram using AND and OR gates.
    2. A logic diagram using only NAND gates (Show AND and OR forms.) You do not have to implement your solution in HDL. You must use the technique for converting And/Or gates to Nand gates that was given in class.

  6. Repeat the previous question for the equation in question 2.

Last updated on 26 Jan 2005 by John Barr