Solved Examples of Truth Table
Example 1: Draw the truth table of the given Boolean expression: A.(B+C)
Solution:
The number of input combinations will be 8 (23=8).
|
A |
B |
C |
B+C |
A.(B+C) |
|---|---|---|---|---|
|
0 |
0 |
0 |
0 |
0 |
|
0 |
0 |
1 |
1 |
0 |
|
0 |
1 |
0 |
1 |
0 |
|
0 |
1 |
1 |
1 |
0 |
|
1 |
0 |
0 |
0 |
0 |
|
1 |
0 |
1 |
1 |
1 |
|
1 |
1 |
0 |
1 |
1 |
|
1 |
1 |
1 |
1 |
1 |
Example 2: Draw the truth table of the given Boolean expression: A.¬ (B + (C.D))
Solution:
There are four inputs so the number of input combinations will be 24=16
|
A |
B |
C |
D |
C.D |
B+(C.D) |
¬(B+(C.D)) |
A.¬(B+(C.D)) |
|---|---|---|---|---|---|---|---|
|
0 |
0 |
0 |
0 |
0 |
0 |
1 |
0 |
|
0 |
0 |
0 |
1 |
0 |
0 |
1 |
0 |
|
0 |
0 |
1 |
0 |
0 |
0 |
1 |
0 |
|
0 |
0 |
1 |
1 |
1 |
1 |
0 |
0 |
|
0 |
1 |
0 |
0 |
0 |
1 |
0 |
0 |
|
0 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
|
0 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
|
0 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
|
1 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
|
1 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
|
1 |
0 |
1 |
0 |
0 |
0 |
1 |
1 |
|
1 |
0 |
1 |
1 |
1 |
1 |
0 |
0 |
|
1 |
1 |
0 |
0 |
0 |
1 |
0 |
0 |
|
1 |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
|
1 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
Truth Table
A Truth Table is a table that lists all the possible combinations of inputs and their corresponding outputs. It shows how the output of logic circuits changes with different combinations of logic levels at the input. It is mostly associated with Boolean algebra or areas where Boolean logic is used. It is a branch of algebra where there are only two values possible true and false.
Table of Content
- Truth Table
- Construction
- Unary Operation Truth Table
- Binary Operations Truth Table
- Applications
- Advantages
- Disadvantages