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
Explain CMOS Inverter with the help of a neat circuit diagram. Ans: CMOS Inverter: The fundamental CMOS logic circuit is an inverter demonstrated in Fig.(a). For above

Question: a Describe the following terms with reference to video editing: 1. Video frame rate 2. Pixel aspect ratio 3. Frame size 4. Temporal compression 5. Spatial comp

How Online Databases Work? An online or web-based database keeps data on a cloud of servers somewhere on the Internet, which is accessible by any authorized user with an Intern

Define the component of a process precedence sequence? Ans. Process name, sequence operator and also concurrency operator components are process precedence sequence.

What are the major characteristics of a pipeline? The major characteristics of a pipeline are: a) Pipelining cannot be executed on a single task, as it works by splitting mu

What are the features of the hardwired control? A controller that uses this approach can function at high speed. It has little flexibility and the complexity of the instruction

Function Modules are also external Subroutines. True.

Memory-to-Memory Architecture : The pipelines can access vector operands, intermediate and final results directly in the main memory. This needs the higher memory bandwidth. How

what is cursor

These days, they're pretty much obsolete; they're definitely system-particular. They had to do with 16-bit programming under MS-DOS and perhaps some early on versions of Windows. I