(A+B+C)' = A'B'C' by using truth table
bx+cy=d bx=d-cy x=d-cy ----- b answer: d-cy ----- b
I don't really know what this is supposed to mean, if you want to print the truth-table of the NAND-gate that will be something like this: for (a=0; a<=1; ++a) for (b=0; b<=1; ++b) printf ("%d %d %d\n", a, b, !(a&&b))
Prove right hand side equal to left hand site by using truth table((A+B.C).(A.C+B))' =A'.B'+ A'.C'+B'.C' ( Marks 5)(NOTE: Fill the given table and make sure the sequence of input remains same as it is given in the table below)ABC((A+B.C) .(A.C+B))'A'.B'+ A'.C'+B'.C'000001010011100101110111
(a+b).c=(a.b)+(b.c) (a+b).c=(a.b)+(b.c)
a XOR bis equivalent to: (a AND NOT b) OR (b AND NOT a)
by analyzing your three input logic network
A truth table is usually a table in which the truth or falsehood of two variables are taken as input and these form the edges of the table. The content of the table shows the truth value of the result of some operation on the variables.
You use a person's name to spell it.
by analyzing your three input logic network
truth table contains inputs and excitation table takes outputs as inputs
Here is its truth-table: A B A and B F F F F T F T F F T T T