The document discusses different implementations of Boolean functions including NAND, AND-OR-INVERT, and NOR. It provides examples of converting binary numbers to decimal, hexadecimal, and octal representations.

1. NAND Implementation The implementation of a Boolean function with NAND gates requires that the function be simplified in the sum-of-products form. Consider the Boolean function F = AB + CD + E

2. AND-OR-INVERT IMPLEMENTATION The two forms NAND-AND and AND-NOR are equivalent forms and can be treated together

3. AND-OR-INVERT implementation The tow forms NAND-AND and AND-NOR are equivalent forms and can be treated together. Both perform the AND-OR-INVERT function

4. NOR implementation The implementation of a Boolean function with NOR gates requires that the function be simplified in the product-of-sum (pos) form. A product-of-sums expression specifies a group of OR gates for the sum terms. Following by an AND gate to produce the product. F =(A+B) (C+D)E

5. Convert binary to decimal 110.001 =? Answer = 6.125 1011.10 = Answer = 11.5 110101 = ? Answer = 53

6. Convert binary to hexadecimal 01111101=? Answer =7d 110101.0101011=? Answer =35.56

7. Convert binary to octal 0110100=? Answer = 064 101100=? Answer = 766