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
Q. What is Program Annotation Packages? A quite renowned scheme in this field is OpenMP a newly designed industry standard for shared memory programming on architectures with u

You are given a collection of words, say as in a dictionary. You can represent it in the following compressed form: the first word will be followed by a sequence of a pair of numbe

They are of two types. They are big endian and little endian. Memory is separated into two bank, 1:even bank 2:odd bank.

Explain User Datagram Protocol. UDP(User Datagram Protocol) : User Datagram Protocol uses a connectionless communication paradigm. It is an application using UDP does not re

Q. Programming with loops and comparisons? This segment deals with more practical illustrations employing comparison, loops and shift instructions. Simple Program Loops

Back propagation Learning Routine - Aartificial intelligence As with perceptrons, the information in the network is stored in the weights, so the learning problem comes down to

The output of a logic gate is 1 when all its inputs are at logic 0. The gate is either ? Ans. When all inputs of logic gate at logic 0 and output is 0. The gate is either a NOR

Q. Illustrate Single In-line Memory Modules? From early days of semiconductor memory till the early 1990s memory was manufactured, brought and installed as a single chip. Chip

What is ASP.NET Authentication Providers and IIS Security? ASP.NET implements authentication using authentication providers, which are code modules that verify credentials and