The question was: Create the necessary Boolean equations based on the scenario below. Simplify the equations depending on the output if necessary. There are 3 inputs to a binary calculator logic gate circuit. The first two bits are reserved for 1 operand, the last bit is the second operand. There would be only three output bits that will communicate the result to communicate it later in decimal. Create a logic gate circuit that will support all sums of every input.
This is how we got the truth table using this table.
| in3 | in2 | in1 |
|---|---|---|
| out3 | out2 | out1 |
| 2² | 2¹ | 2⁰ |
| 4 | 2 | 1 |
We have arrived at the this truth table:
| in1 | in2 | in3 | out3 | out2 | out1 |
|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 0 | 0 |
I'm lost on how we arrived at the resulting truth table above using the table before the truth table.