It represents one of the two specified logic levels. These are of course 1 & 0. In the electrical world both of these represent specified low voltage levels. ie 1 might represent a voltage level of +5v & 0 -5v. So in this example in the truth table for a particular senario 0 stands for -5v.
Input Output 0 1 1 0
.....0 10 | 0 01 | 0 1.....0 10 | 0 11 | 1 10 | 11 | 0
apparently whenever you can swap the 0's for 1's and 1's for 0's in the truth table and the truth result remains unchanged.
Truth table of 'NAND' is 0 0 - 1 0 1 - 1 1 0 - 1 1 1 - 0 NAND is just opposite of AND as the name itself suggest NAND is the not of AND Truth table of "NOR" is 0 0 - 1 0 1 - 0 1 0 - 0 1 1 - 0 NOR is just opposite of OR as the name itself suggest NOR is the not of OR.
truth table contains inputs and excitation table takes outputs as inputs
Its truth table is: input output 0 1 1 0
Input Output 0 1 1 0
1 and 0 equal 0. "AND" behave like multiplication.
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
.....0 10 | 0 01 | 0 1.....0 10 | 0 11 | 1 10 | 11 | 0
apparently whenever you can swap the 0's for 1's and 1's for 0's in the truth table and the truth result remains unchanged.
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.
Truth table of 'NAND' is 0 0 - 1 0 1 - 1 1 0 - 1 1 1 - 0 NAND is just opposite of AND as the name itself suggest NAND is the not of AND Truth table of "NOR" is 0 0 - 1 0 1 - 0 1 0 - 0 1 1 - 0 NOR is just opposite of OR as the name itself suggest NOR is the not of OR.
truth table contains inputs and excitation table takes outputs as inputs
It is the very same in every programming language. For example: AND: 0 && 0 = 0 0 && 1 = 0 1 && 0 = 0 1 && 1 = 1
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))
Because if input A *and* input B is true, then the output is true! Truth table of AND gate: ┌─┬─╥───────┐ │A│B║Q (Output)│ ├─┼─╫───────┤ │0│0║0..............│ ├─┼─╫───────┤ │0│1║0............. │ ├─┼─╫───────┤ │1│0║0............. │ ├─┼─╫───────┤ │1│1║1............. │ └─┴─╨───────┘