AND &- operates like a 2 bit truth table- if either bit is zero, yield bit is zero too- both bits must be one for the yield bit to be one	0011      & 0101	----	0001	-------------------------------------------------XOR ^- bitwise exclusive OR- returns 1 when either bit but not both are 1	0011      ^ 0101	----	0110- an XOR applied twice yields the original operand-------------------------------------------------OR |- two bits ORed yield 1 if either or both bits are 1 and 0 if both bits are 0- used to combine bits from different variables into a single variable	0011      | 0101	----	0111-------------------------------------------------RIGHT SHIFT >>- moves each bit in operand to the right the indicated number of places- shifting right one bit same as dividing operand by 2-------------------------------------------------BITWISE LEFT <<- always shifts in 0 bits from the right discarding left most bits- each bit shifted is equivalent to multiplying by 2- so shifting left 3 bits is like muliplying by 8-------------------------------------------------BITWISE COMPLEMENT ~ (unary)- reverses each bit- complementing a number twice returns the orginal number