I'm trying to solve two questions that I am unsure how to approach. I know boolean means true/false but that's about it.
The question reads: "A boolean equation in sum-of-products can be minimized as Y = AB + BD + ACD. I'm not sure how to approach this. I see binary numbers. and the solution must be either true or false. In C, 0 usually means true (==0).
The second parts asks to "draw the full-adder."
As I am learning more about drawing logic circuits I realized I should have stated the equation is Y = |A|B + |B|D + AC|D. You can see this on the page I drew and attached. Can you confirm that the circuit drawing is correct? Thank you very much.