Is my truth table for this Logic Circuit correct?

Question

How would I make a truth table for this Logic Circuit

enter image description here

My attempt:

enter image description here

I think the logic expression would be along the lines of:

Z= −(−(A∧B)∨−(A∧B)∧−(B∧C))∧(−(A∧B)∧−(B∨C))

For example when A = 1, B = 0 and C = 1 http://i.imgur.com/TpoX7dS.png — Linus Gill, Sep 14 '14 at 04:11
Why are you adding examples in comments? Update the question instead. — Barmar, Sep 14 '14 at 04:11
Is my truth table correct? And secondly although not as important what would be the actual logic expression for this circuit. — Linus Gill, Sep 14 '14 at 04:21
This question appears to be off-topic because logic diagrams are not a *programming* problem. — Stephen C, Sep 14 '14 at 04:40
I could probably validate your truth table for you, but it is just a lot of hard work. (And too much for a patently off-topic Question!) However, >>if<< your working is correct, then the real expression is `Z = 0` — Stephen C, Sep 14 '14 at 04:44

score 1 · Answer 1 · edited Dec 12 '15 at 20:03

1

Using

Assuming I have not made an error, this reduces to False for all inputs.

x1 = Nand[a, b];
x2 = Or[b, c];
x3 = And[x1, And[x1, Not[x2]]];
x4 = Nor[x1, x3];
x5 = And[x3, x4];

The truth table:

TableForm[BooleanTable[{a, b, c, x5}, {a, b, c}], 
TableHeadings -> {None, {a, b, c, x5}}]

and BooleanMinimize[x5] yields False

edited Dec 12 '15 at 20:03

ArtKorchagin

answered Sep 14 '14 at 04:49

Linus Gill

score 0 · Accepted Answer · answered Sep 14 '14 at 04:45

0

yes, the table is correct. The logic expression can be simplified to Z=0

answered Sep 14 '14 at 04:45

Garr Godfrey

as for the non-simplified logic expression, that also appears to be correct. – Garr Godfrey Sep 14 '14 at 04:55

2 Answers2