Difference between revisions of "Boolean Algebra"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
(OR Identities)
(Distributive Law)
Line 59: Line 59:
  
 
==Distributive Law==
 
==Distributive Law==
 +
The distributive law is these two equations.
 +
 +
<math> A.(B+C) = A.B + A.C </math>
 +
 +
<math> A+(B.C) = (A+B).(A+C) </math>
  
 
==Redundancy Law==
 
==Redundancy Law==

Revision as of 09:27, 8 May 2018

Any equation must be within the <math> </math> tags. For Boolean alegbra the main issue is how to negate a term like:

¯a or ¯¯a+b

this can be done by adding the following around any term you wish to negate.:

<math> \overline{} </math>  

¯a

is

 <math> \overline{a} </math>

¯¯a+b

is

 <math> \overline{\overline{a}+b} </math>.

Identities

AND Identities

A=A

This equation means that the output is determined by the value of A. So if A =0, The output is 0, and vice versa.

0.A=0

Because there is a 0 in this equation, the output of this will always be 0 regardless of the value of A.

A.A=A

The output is determined by A alone in this equation. This can be simplified to just "A".

A.¯A=0

OR Identities

The logic gate 'OR' in Boolean algebra is represented by a '+' symbol. The identities for the 'OR' gate in Boolean algebra is as follows:

0+A=A "If 0 or A go in, A is the output"

1+A=1 "If 1 or A is the output, 1 is the output"

=Laws===CommutativeLaw==TheCommutativeLawiswhereequationsarethesamenomatterwhatwayaroundthelettersarewritten.Forexample<math>A+B=B+A or

[math] A.B=B.A [/math]

Associate Law

Distributive Law

The distributive law is these two equations.

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

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

Redundancy Law

Identity Law

Negation Law

Equations

Solving equations is a matter of applying the laws of boolean algrebra, followed by any of the identities you can find:

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Example 7