Three-Variable K-Map: Verify a Claimed Minimal SOP
A control unit evaluates a three-variable Boolean function to trigger an alert based on sensor states.
Expected behavior:
| A | B | C | Y | |-----|-----|-----|-----| | 0 | 0 | 0 | 0 | | 0 | 0 | 1 | 1 | | 0 | 1 | 0 | 1 | | 0 | 1 | 1 | 1 | | 1 | 0 | 0 | 0 | | 1 | 0 | 1 | 1 | | 1 | 1 | 0 | 0 | | 1 | 1 | 1 | 1 |
Simulation shows Y = 0 for input A=0, B=1, C=0 and Y = 1 for input A=1, B=1, C=0. The output is incorrect for these specific states. Inspect the circuit and correct the fault.
Constraints
- Do not add or remove any gates.
- Modify the existing wire connections to implement the correct minimal Sum of Products logic.
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.