Build F = A(B + C) from Factored Form
Logic synthesis tools frequently factor Boolean expressions to minimize area and delay on silicon. Directly implementing a factored expression reduces the total gate count compared to standard Sum-of-Products form.
Construct a circuit that implements the Boolean function F = A(B + C).
| A | B | C | F | |-----|-----|-----|-----| | 0 | 0 | 0 | 0 | | 0 | 0 | 1 | 0 | | 0 | 1 | 0 | 0 | | 0 | 1 | 1 | 0 | | 1 | 0 | 0 | 0 | | 1 | 0 | 1 | 1 | | 1 | 1 | 0 | 1 | | 1 | 1 | 1 | 1 |
Constraints
- Implement the circuit using exactly one 2-input AND gate and one 2-input OR gate.
- Do not expand the expression into Sum-of-Products form.
- Combinational logic only.
Topics
Solve this problem
Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.
This problem is part of Codiode Pro. The statement above is free to read.
The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.