A bit is the minimum amount of information that we can imagine, since it only stores either value 1 or 0, that represents YES or NOT, activated or deactivated, true or false, etc... that is: two possible states each one opposite to the other, without possibility of shades.

Several operations can be performed with bits, either in conjunction with other bits or themselves alone. These operations receive the name of boolean operations, a word that come from the name of one of the mathematicians who more contributed to this field: George Boole (1815-1864).

All these operations have a predetermined behavior and all of them can be applied to any bit being anyone the value contained in it (0 or 1). Next you have a list of the basic boolean operations and a table with the behaviour of that operation with every possible combination of bits.

AND

this operation is performed between two different bits (a and b). The result is 1 if both a and b are equal to 1, if anyone of them is equal to 0 the result is 0

AND (&)

a	b	a&b
0	0	0
0	1	0
1	0	0
1	1	1

OR

this operation is performed between two different bits (a and b). The result is 1 if any of them a or b is 1. If noone is equal to 1 the result is 0

OR (|)

a	b	a|b
0	0	0
0	1	1
1	0	1
1	1	1

XOR (Exclusive Or)

this operation is performed between two different bits (a and b). The result is 1 if any of them a or b is 1 except if both they are it. If neither or both are equal to 1 the result is 0

XOR (^)

a	b	a^b
0	0	0
0	1	1
1	0	1
1	1	0

NOT

This operation is performed on a single bit. Its result is the inversion of the present value of the bit: if it contained 1 passes to contain 0 and if it contained 0 it passes to contain 1:

NOT (~)

a	~a
0	1
1	0

These are the 4 basic boolean operations (AND, OR, XOR and NOT). Combining these operations any desired result can be obtained.

Copyright © Escuela Campo Alegre, 2000-2001. All rights reserved
Website developed and maintained by Shashi Krishna, HS Computer Science.