Q. Explain about truth table and logic diagram?

A Boolean function can be realized in a logic circuit employing the basic gates: - AND, OR & NOT. Concern here for illustration Boolean function: -

Relationship between this function and its binary variables A, B, C can be signified in a truth table as displayed in figure (a) and figure (b) shows respective logic circuit.

Figure:   Truth table & logic diagram for F = A¯ B + C

So in a logic circuit variables coming on left hand side of boolean expression are inputs to circuit and variable function coming on right hand side of expression are taken as output.

There is one significant point to note it implies that there is just one way to signify the boolean expression in a truth table however can be expressed in variety of logic circuits.