Boolean Algebra laws: Overview, Questions, Preparation

Algebra 2021 ( Maths Algebra )

Rachit Kumar Saxena
Updated on Aug 27, 2021 12:25 IST

By Rachit Kumar Saxena, Manager-Editorial

Boolean algebra is the algebra group in which the values of the variable are the values of truth, true and false, usually denoted as 1 and 0, respectively. It is used to study digital circuits and simplify them. It's often referred to as Binary or Rational Algebra. In the development of digital electronics, it has been fundamental and is provided for in all modern programming languages. It is often used in set theory and statistics.

Table of content
  • What are the Laws of Boolean Algebra?
  • Weightage of Boolean Algebra in Class 11
  • Illustrated Examples on Boolean Algebra
  • FAQs on Boolean Algebra
Maths Algebra Logo

What are the Laws of Boolean Algebra?

Conjunction (almost), disjunction (almost) and negation (almost) are the major operations performed in Boolean algebra. Therefore, this algebra is somewhat distinct from elementary algebra where computational and integer operations, such as addition, subtraction are the values of variables.

There are six types of Boolean algebra laws. They are:

1. Commutative law = A. B = B. A
                               A + B = B + A

2. Associative law = ( A. B ). C = A . ( B . C )
                              ( A + B ) + C = A + ( B + C)
3. Distributive law = A. ( B + C) = (A. B) + (A. C)
                            A + (B. C) = (A + B) . ( A + C)

4. AND law =  These laws use the AND operation. Therefore they are called AND laws.

5. OR law = These laws use the OR operation. Therefore they are called OR laws.

6. Inversion law =  This law uses the NOT operation. The inversion law states that double inversion of variable results in the original variable itself.

Important Boolean Theorems

Here are a few Boolean theorems.

Boolean Function

Theorem Overview

Boolean Functions

Boolean Functions and Expressions, K-Map and NAND Gates

Theorems of De Morgan

De Morgan Theorem 1 and Theorem 2

Maths Algebra Logo

Weightage of Boolean Algebra in Class 11

You will come across some of the Boolean algebra parts in the real number chapter, but it's not in much detail. The weightage of real numbers is 5-6 marks.

Explore exams which ask questions on Maths Algebra

Select your preferred stream

Maths Algebra Logo

Illustrated Examples on Boolean Algebra

1. According to Boolean Algebra, (A+AB) =?

Solution.

It is equal to A.

2. Simplify the given expression:  (A + B)(A + C)

Solution.

(A + B).(A + C) 
A.A + A.C + A.B + B.C - Distributive law 
A + A.C + A.B + B.C - Idempotent AND law (A.A = A) 
A(1 + C) + A.B + B.C - Distributive law 
A.1+ A.B + B.C - Identity OR law (1+ C =1)
A(1+B) + BC - Distributive law 
A1+ BC - Identity OR law (1 + B =1) 
A+(BC) - Identity AND law (A.1= A) 
Answer: A+(BC)

3.State and verify Associative law.
Solution.

(A+B)+C=A+(B+C)
(A.B).C=A.(B.C)
(A+B)+C=A+(B+C)
Similarly, we can prove,
A.(B.C)=(A.B).C

Maths Algebra Logo

FAQs on Boolean Algebra

Q: What are the Boolean algebra laws?

A: The fundamental laws of Boolean Algebra relating to the Commutative Law allowing a change of place for addition and multiplication, the Associative Law allowing addition and multiplication brackets to be omitted, and the Distributive Law allowing an expression to be factored are called the Boolean Algebra Laws.

Q: In Boolean algebra, what is the absorption law?

A: In algebra, an identity relating to a pair of binary operations is the absorption law or absorption identity. Two binary behaviors, ^, and v are said to be related by the rule of absorption if a ^ (a v b) = a v (a ^ b) = a. A set loaded with two binary operations ("join") and commutative, associative, and idempotent.

Q: What is an example of Boolean algebra?

A: Boolean algebra is a mathematics division that addresses operations on logical values and integrates binary variables. Boolean algebra traces its history to the mathematician George Boole's 1854 book. Boolean algebra's distinguishing characteristic is that it deals only with the analysis of binary variables.  

Q: Is Boolean algebra difficult?

A: Boolean Algebra is a basic logic at its heart that becomes complex as the topic scales up. 

Q: What are the 3 basic Boolean algebra operations?

A: Conjunction, disjunction, and negation are the major operations performed in Boolean algebra. Therefore, this algebra is somewhat distinct from elementary algebra where computational and integer operations, such as addition, subtraction are the values of variables.
qna

Maths Algebra Exam

Student Forum

chatAnything you would want to ask experts?
Write here...