Welcome to Edukum.com

Boolean algebra is a mathematics which always results in either true or false, or 0 or 1. Boolean algebra was first introduced in 1847 by George Boole. Boolean algebra is a way by which we can represent results in digital electronics.

The decision which may results into true or false is known as binary decision. There are only two possible values

For example:

- Indira Gandhi is the only woman Prime Minister of India.
- 13 - 2 = 11
- 3 - 2 = 2

In the above three examples, the first two sentences are true having ‘1’ decision value and the last one is false having ‘0’ as a decision value.

**Logic Gates**

**Conjunction (AND) Operation**

Boolean expressions are the expressions in which, if we have two variables x and y then when both the two sentences are true that means it is in conjunction form of operation.**A****B****Y**1 1 1 1 0 0 0 1 0 0 0 0 **Disjunction (OR) Operation**

Boolean expressions are the expressions in which, if we have two variables x and y then if one of the two sentences is true that means it is in disjunction form of operation.**A****B****Y**1 1 1 1 0 1 0 1 1 0 0 0 **Inverter (NOT) Operation**

It is an operator that gave results invert to the input. If we have a true input then output will be false.**A****Y**1 0 0 1

© 2019 EDUKUM.COM ALL RIGHTS RESERVED