- 1 Using Boolean Algebra Simplify The Following Expressions F1 Abc A B 7 Abod F2 Abcd Ab Cd Abcd F 1 (58.38 KiB) Viewed 29 times
= 1. Using Boolean algebra, simplify the following expressions. F1 = ABC + (A + B + 7) + ĀBOD F2 ABCD + AB(CD) + (ABCD F
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
= 1. Using Boolean algebra, simplify the following expressions. F1 = ABC + (A + B + 7) + ĀBOD F2 ABCD + AB(CD) + (ABCD F
= 1. Using Boolean algebra, simplify the following expressions. F1 = ABC + (A + B + 7) + ĀBOD F2 ABCD + AB(CD) + (ABCD F3 = X7Z + XYZ + W XY + WY + WXY F4 = A + B[C+ D(B + ] = = = Figure 1 7400 NAND DIP a. Build the Truth Table for F1 and F4 functions 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?