1. Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs and NANDs. NOT terms or Inverted terms are represented with a line over the terms AB = A + B A + B = AB

2. To convert A+B into a form that can be implemented using a NAND gate follow these steps: 1. Double Complement the term A+B = A+B 2. Use DeMorgan’s to distribute one of the complements A+B = A B The equation is now a NAND of the complemented inputs. To convert AB into a form that can be implemented using a NOR gate follow these steps: 1. Double Complement the term AB = AB 2. Use DeMorgan’s to distribute one of the complements AB = A + B The equation is now a NOR of the complemented inputs.

3. ABOutput 000 011 100Out = A B 110DoubleC A B DeM A + B Simplify A + B

4. Exercise 1 ABCOutput 0001 0010 0100Out = A B C + A B C 0110DoubleC A B C + A B C 1000DeM (A B C) ( A B C) 1010 1101 1110 1.Draw a gate diagram that implements this function in three NAND gates plus invertors. Your diagram will have two levels of NAND gates.

5. Exercise 2 1.Build a truth table for the following problem: PC power/security. A computer needs to be secured from un-authorized access in the following way: The power should only come on when A. The security key is present in the lock B. The case cover is closed C. The user presses the power-on button. 2.Use DeMorgan’s and boolean algebra to convert a function extracted from your truth table above, into one that can be constructed with either NANDs or NORs. 3.Draw a circuit diagram with gates that implements your function from step 2.