Boolean Algebra
Binary Boolean Algebra

Boolean Algebra (This is the easy part of it)

Comparative logic equations. Sounds hard right. Well guess what its not.

Here's the basic idea

Function Use Truth Table
And

If both A and B equal 1 then  C is 1

A AND B = C A | B | C
0 | 0 | 0
1 | 0 | 0
0 | 1 | 0
1 | 1 | 1
Or

If A or B equal 1 the C is 1

A OR B = C A | B | C
0 | 0 | 0
1 | 0 | 1
0 | 1 | 1
1 | 1 | 1
Nand

If A and B are NOT equal to 1 then C is 1

A NAND B = C A | B | C
0 | 0 | 1
1 | 0 | 1
0 | 1 | 1
1 | 1 | 0
Nor

If A or B are NOT equal to 1 then C is 1

A NOR B = C A | B | C
0 | 0 | 1
1 | 0 | 0
0 | 1 | 0
1 | 1 | 0
Xor

If EITHER A or B equal 1 then C is 1

A XOR B =C A | B | C
0 | 0 | 0
1 | 0 | 1
0 | 1 | 1
1 | 1 | 0
Invert

A is NOT B

A NOT = B A | B
0 |1
1 | 0

 

 

Home ] Bomb ] TTY ] RC Car ] BASIC Stamp ] Wall Paper ] [Post 891]

Send mail to mwhited@post891.org with bugs, questions, or comments about this web site.
Last modified: 06/13/2000