Understanding Boolean Algebra through Truth Table
Let’s understand it using truth table:
Let Y= (A AND B) OR (C AND (NOT D))
Input |
Output |
|||||
---|---|---|---|---|---|---|
A |
B |
C |
D |
A AND B |
C AND (NOT D) |
Y |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
0 |
1 |
Logical Circuit Diagram of Boolean Algebra Example
Let’s see it’s circuit diagram
Basics of Boolean Algebra in Digital Electronics
In the time middle of the 19th century, mathematician George Boole introduced a new form of mathematical reasoning system which is widely known as Boolean Algebra. This is a special branch of mathematics in which all logic is based on only two representations True(1) and False,(0). In modern science, Boolean algebra has become a very integral part of applications in different fields like –> computer science, digital electronics, and mathematical logic reasoning.
Contact Us