Note that we've changed the due date from 11/5 to 11/10.


                        Homework Assignment 8
                                CS 429

   Unique Numbers: 52915, 52920, 52935, 52940, 52945, 52960, 52965
                              Fall, 2014

                       Given:  October 27, 2014
                        Due:  November 10, 2014

Here are some problems that relate to your understanding of material
presented in class.

1. Is {XOR, NOT} a functionally complete set of gates?  Give an argument.

2. Write the truth table for NAND.  Show how you could implement NAND
   using gates from the set {OR, NOT}.

3. Show that { NAND } is a functionally complete set of gates.

4. Design a 3-bit even parity circuit.

    (a) Show the truth table.

    (b) Show a circuit implementation using only gates from the set
        {AND, OR, NOT}.

5. Redo the previous problem (both parts) for odd parity.

6. Assume you have your even parity module from problem 4  Build
   an odd parity circuit using it and one additional gate.

7. Using C-langauge statements, implement a four-bit adder
   circuit where the following nine integer variables, represent
   Boolean true with 1 and Boolean false with 0.  Use the coding
   rules from Laboratory 1, but you may not use "+" or "-".  The
   variable "ans" should be a number between 0 and 31.

   int a0, a1, a2, a3;
   int b0, b1, b2, b3;
   int cin;

   int four-bit-adder ( int a0, int a1, int a2, int a3,
                        int b0, int b1, int b2, int b3,
                        int cin )
    {
       // Solution...


       int ans =
    }