Boolean algebra, Computer Engineering

Boolean algebra.

Boolean algebra mathematical method based on human reasoning. In Boolean algebra only two states exist; true and false which are written as 1 (true) and 0 (false). Boolean variables can only take one of these two values. The basic laws of Boolean algebra govern how an expression can be manipulated. The first three laws define the basic Boolean operations NOT, AND and OR.

 

1) Definition of NOT.

NOT(True) = False            1¯   ->0

NOT(False) = True            0‾ ->1

 

2) Definition of AND (two variables).

False.AND.False = False        0.0  =  0

False.AND.True = False         0.1  =  0

True.AND.False = False         1.0  =  0

True.AND.True = True           1.1  =  1

 

3) Definition of OR (two variables).

False.OR.False = False           0 + 0  =  0

False.OR.True = True             0 + 1  =  1

True.OR.False = True             1 + 0  =  1

True.OR.True = True              1 + 1  =  1

 

4) Zero and unit rules (here we introduce the Boolean variable, X, which can be either true or false).

True.AND.X = X                 1.X  =  X

False.AND.X = False          0.X  =  0

True.OR.X = True                1 + X  =  1

False.OR.X = X                   0 + X  =  X

 

5) Complement relations.

X.AND.(NOT(X)) = False  

X.OR.(NOT(X)) = True       

NOT(NOT(X)) = X             

 

 

6) Idempotence.

X + X = X

X.X = X

 

7) Commutative laws (now have two variables X and Y).

X + Y = Y + X

X.Y = Y.X

 

8) Associative laws (insertion of brackets).

X + Y + Z = X + (Y + Z) = (X + Y) + Z

X.Y.Z = X.(Y.Z) = (X.Y).Z

 

9) Distribution laws.

X.(Y + Z) = X.Y + X.Z

X + Y.Z = (X + Y).(X + Z)

 

10) Absorption rules.

X + X.Y = X

X.(X + Y) = X

 

 

11) de Morgan's Theorem (for any number of variables).

 

155_de morgans.png

Posted Date: 8/20/2012 10:52:54 PM | Location : United States







Related Discussions:- Boolean algebra, Assignment Help, Ask Question on Boolean algebra, Get Answer, Expert's Help, Boolean algebra Discussions

Write discussion on Boolean algebra
Your posts are moderated
Related Questions
Enumerate the Design reusability of VHDL VHDL.  Functions  and  Procedures  may  be  placed  in  a  package  so  that  they  are  available  to  any design-unit which wishes t

In IP addressing scheme, class used for multicasting is: A class used for multicasting in IP addressing scheme is class D.

Define the concept of Inheritance Inheritance is property of reusing the code within the object oriented development. While modelling, we look at the all the classes, and try

Smart Card & E-Cash E-cash storable smart cards can kept and dispense cash electronically, making bills and coins lesser essential. It transfers funds over phone lines, making

Clear operation The clear operation compares words present in A and B and produces an all 0's result if two numbers are equal. This operation is achieved by the exclusive-OR mi

Equivalences & Rewrite Rules - artificial intelligence: Along with allowing us to verify trivial theorems, tautologies make us able to establish that definite sentences are say

What is Constrained-Random Verification ? As ASIC and system-on-chip (SoC) designs continue to increase in size and complexity, there is an equal or greater increase in the si

Write a 'C' program to accept any 3 digit integer number from the keyboard and display the word equivalent representation of the given number

Given a four level hierarchical storage system consisting of: cache,  primary storage, secondary storage, and tertiary storage. Suppose the following:  programs may be executed on

program to find area under the curve y=f(x) between x=a and y=b , integrate y=f(x)between limits of a and b