Boolean Algebra is basically a choice between two options (i) yes or no (ii) high or low.

**BOOLEAN ALGEBRA**

Boolean Algebra is basically a
choice between two options (i) yes or no (ii) high or low. These two options in
Boolean algebra are represented by binary numbers 0 or 1. It is a concept that
relates logic and mathematics which is a century old, made up by George Boole
in 1854. Later the importance of Boolean algebra was realized in the design of
computer circuits. Today we are in a digital world and most of the comforts
that we experience is due to digitization with the foundation based on Boolean
algebra.

The concept of high (1) and low(0)
isnotanewone. Infact, it was applied in telephone switching circuits by Shannon
in 1938.

** **

The NOT, OR and AND operations
discussed in 9.5.2 are the Boolean operations. The results of these operations
can be summarised as:

The OR laws can be realised as

The AND laws can be realised as

The Boolean operations obey the
following laws.

A + B = B + A

A . B = B . A

A + (B + C) = (A + B) + C

A . (B . C) = (A .B) . C

A( B + C) = AB + AC

A + BC = (A + B) (A + C)

The above laws are used to simplify
complicated expressions and to simplify the logic circuitry.

Tags : Laws and Concept , 12th Physics : UNIT 10a : Semiconductor Electronics

Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail

12th Physics : UNIT 10a : Semiconductor Electronics : Boolean Algebra | Laws and Concept

**Related Topics **

Privacy Policy, Terms and Conditions, DMCA Policy and Compliant

Copyright Â© 2018-2024 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.