Applications of Boolean Algebra
For example we will only see the brief details about the basic gates and solve one complex Boolean expression.
- AND operator: This operator is represented with ( * specifically with ⊗). In this case if both the variables have true(1) value then only result will be true(1), otherwise result will be false(0).
- OR operator: This operator is represented with (+, specifically ⊕). In this case if only one variable has true(1) value then the result will be true(1). If and only if both variable have false(0) value then the result will be false(0).
- NOT operator: This operator is represented with (‘). Here, if the variable has true(1) value then the result will be false(0) and vice versa.
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