Truth Tables

Truth Tables are used for the description of data according to the different values. In digital electronics truth table are used as the Basic Terms to explain boolean algebra and Logic gates. In short truth table is used to explain the logic basically in the connection with the Boolean algebra, Boolean Functions and propositional Calculus.
Understanding truth tables is not difficult, the explanation is shown below:
A truth table has one column for each input variable and the result is shown in the last column for all the possible results of logical operation for which a table is designed. One possible configuration of input variables is denoted by the rows of truth table.
Some terms are necessary for understanding the truth tables. The first concept is logical identity and logical negation.
Logical identity is an operation on one logical value that gets the value true if the operand is true and a false value if the operand is false.
The logical negotiation is an operation on the logical values and the operand is true if the operand is false.
Logical conjunction is an operation on two values that is the value of two propositions; the result produces a value true if both the operands are true.
Logical disjunction is an operation of two propositions that gives the result true if at least one of its operands is true.
Logical implication is an operation of two propositions that shows the value is false in case the first operand is true and the second operand is false.
Logical equality is known as bi conditional and is an operation of two propositions that shows the value is true if either both operands are true or false.
Logical NAND is an operation of two propositions that shows the value is false if both the operands show the value true. One of its operands must be false to make the value true.