EECS 150 Homework 1 Spring 1999

1) Given the following statement:

F is true if and only if ((B is equal to 1) and (A is not equal to 1)) or  ((A is equal to 1) and (B is not equal to 1)) or ((A is equal to 1) and (B= is equal to 1))
    a) Give the truth table for the above statement
    b) Rewrite the statement using Boolean operators (AND, OR, NAND, etc.).= Perform any simplifications you feel necessary
    c) Show a two stage switch level implementation of the gate (hint: switches= that are on when the inputs are high should pull nodes down to ground,= switches that are on when the inputs are low should pull nodes high to= VDD).
2) Show two ways to implement an inverter using:
    a) one NAND gate
    b) one NOR gate
    c) one XOR gate
Problems from Katz: 1.1a-c, 1.6, 1.12, 2.1, 2.10, 6.1, 6.2