# Boolean Algebra using Logic Gates Boolean Algebra is used to simplify long/complex Boolean expressions. It is needed to optimise the use of logics gates (and hence transistors) when making an electronic circuit. Considering that the CPU is made of billions of logic gates, it is essential to find the optimal logic gates circuits to solve a given problem.

There are a few Boolean Algebra rules that are used to simplify Boolean expressions. In this challenge, you will recreate some logic gates circuits to verify some of these rules.

You can also investigate these rules further by simplifying Boolean expressions on this challenge.

The first few circuits have already been completed and your task is to create more logic gates circuits to verify the following rules.

Double NegationComplement LawsAssociative LawsDistributive LawsAbsorptive LawsDe Morgan's Rules

¬ ¬A = A

A ∧ ¬A = 0
A ∨ ¬A = 1

#### Associative Laws

(A ∧ B) ∧ C = A ∧ (B ∧ C)
(A ∨ B) ∨ C = A ∨ (B ∨ C)

#### Distributive Laws

A ∧ (B ∨ C) = (A ∧ B) ∨ (A ∧ C)
A ∨ (B ∧ C) = (A ∨ B) ∧ (A ∨ C)

A ∧ (A ∨ B) = A
A ∨ (A ∧ B) = A

#### De Morgan’s Rules

¬(A ∨ B) = ¬A ∧ ¬B
¬(A ∧ B) = ¬A ∨ ¬B

#### Logic Gates Circuit

Did you like this challenge?

Click on a star to rate it!

Average rating 4.7 / 5. Vote count: 26

No votes so far! Be the first to rate this post.

As you found this challenge interesting...