CS 150 Homework #7
Due October 24th

(1) Seymore Cray once built a computer using only NAND gates for logic. Show that NAND gates is sufficient to form all boolean expressions. Show that NOR gates are sufficient. Show that AND gates are NOT sufficient. Show that XOR gates are NOT sufficient.

(2) For a 2 bit adder, construct the truth table. Write the canonical sum of products form, and canonical product of sums form for all 3 outputs. Minimize these using algebraic simplification. Two Bit Adder

(3) For a 2 bit adder who's carry in is 1, use Karnaugh maps to minimize the logic functions for all 3 outputs.

(4) Katz 2.7, 2.8, 2.10.

This page is maintained by Nick Weaver (nweaver@cs.berkeley.edu)