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
Difference between aggregation and association Aggregation is a particular form of association, not an independent concept. Aggregation acts semantic connotations. If two objec

Q. How to convert Binary to Octal and Hexadecimal? Rules for these conversions are simple. For converting binary to octal binary number is splitted in groups of three, that are

Consider the following set of jobs with their arrival  times, execution time (in minutes), and deadlines. Job Ids Ar r ival Time E xecuti

Parallel Computers In India, the design and development of parallel computers in progress in the early 80?s. The Indian Government recognized the Centre for Development of Adva

Words having 8-bits are to be stored into computer memory.  The number of lines required for writing into memory are ? Ans. 8-bit words needed 8 bit data lines.

What is the maximum size of the memory that can be used in a 16-bit computer and 32 bit computer? The maximum size of the memory that can be used in a 16-bit computer is 2 memo

Explain Performance Evaluation in parallel Computing In this section, we will discuss the key attributes used to measure performance of a computer system. The performance chara

Multi-Layer Artificial Neural Networks - Artificial intelligence: Now we can look at more sophisticated ANNs, which are known multi-layer artificial neural networks because the

What is the File-system security Most commercial servers use a powerful operating system as base that provides good methods of file-system security. Some servers require additi

Define seek time and latency time.  The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wai