in the easiest way how can this expression be simplified? what is the simplified answer? penchod.
Which expression are you talking about?in the easiest way how can this expression be simplified? what is the simplified answer? penchod.
First, this is a homework problem and so answers aren't supposed to be just given out.¬A.¬B.¬C + A.B.¬C + A.¬B.C + A.B.C what is this in its simplest form
It's A' + BC, just to keep us on the same page.a + bc.
What gates are you limited to? To match Boolean algebra, that would be NOT, AND, and OR in any width (so a 12 input AND gate would be legal). Or are you limited to 2-input gates? Are you limited to NOT, NAND, and NOR? This is a common limitation in the real world along with a maximum on the number of inputs to any one gate, often in the four range. Can you use XOR?i need whatever has the least amount of gates
Okay, so then you need to show YOUR work on YOUR homework problem. And, actually, you need to keep in mind that this is the OP's thread and that you are technically hijacking it, but at least you are talking about the OP's original problem. So show your work and you and the OP can collaborate and we can provide hints and suggestions. We will not just give out answers.yes xor can be used and were not limited to any gates