1. Using Boolean algebra, simplify the following expressions. F1 = ABC + (A + B +...

Transcribed Image Text:

1. Using Boolean algebra, simplify the following expressions. F1 = ABC + (A + B + C) + ABCD F2 = ABCD + AB(CD) + (AB)CD F3 = XYZ + XYZ + WXY + WXY + WXY F = A + B[C + D(B + C)] a. Build the Truth Table for F1 and F4 functions Figure 1 7400 NAND DIP b. Draw the circuit diagram for both unsimplified and simplified equations of F2 and F3 c. How many 7404, 7408, and 7432 chips do you need to implement the simplified and unsimplified circuits of F1, F2, F3 and F4? 1. Using Boolean algebra, simplify the following expressions. F1 = ABC + (A + B + C) + ABCD F2 = ABCD + AB(CD) + (AB)CD F3 = XYZ + XYZ + WXY + WXY + WXY F = A + B[C + D(B + C)] a. Build the Truth Table for F1 and F4 functions Figure 1 7400 NAND DIP b. Draw the circuit diagram for both unsimplified and simplified equations of F2 and F3 c. How many 7404, 7408, and 7432 chips do you need to implement the simplified and unsimplified circuits of F1, F2, F3 and F4?