CS 200 - Assignment #2

This assignment is due (hard copy, do not email) at the beginning of class on 10/8.

Prove using Boolean Algebra (not truth tables) that the NAND operation is universal. I.e. It is possible to construct any other boolean operator (NOT,AND,OR,NOR or XOR) using only NAND.

Repeat the previous question for NOR.

Rafiquzzaman, Chapter 3

Problems: 3.1, 3.2, 3.4(a)(b)(c)(e)(f), 3.5(a)(b), 3.9(a)(b), 3.10(a)(c), 3.16, 3.19