Bitwise Operations

Overview

Binary operation: manipulation of individual bits in binary data or numbers.

Negative number conversion

• Convert number into 2's complement (binary): 7 -> 0111
• Invert all the bits: 0111 -> 1000
• Add 1: 1000 -> 1001

Bitwise operations

Operator	Description	Example
AND (&)	If both bits are 1, the result is 1; otherwise 0	0101 (5) & 0011 (3) ---- 0001 (1)
OR (|)	If any bit is 1, the result is 1; otherwise 0	0101 (5) | 0011 (3) ---- 0111 (7)
XOR: exclusive OR (^)	If the bits are different, the result is 1; otherwise 0	0101 (5) ^ 0011 (3) ---- 0110 (6)
NOT (~)	Flips the bits. Each 0 becomes 1, and each 1 becomes 0	0000 0101 (5) ~ -------- 1111 1010 (-6)
Signed Left Shift (<<)	Shifts the bits of the left operand to the left by a number of positions specified by the right operand	# positive number 0000 0101 (5) << 0000 0010 (2) --------- 0001 0100 (20) # negative number 1111 1011 (-5) << 0000 0010 (2) --------- 1110 1100 (-20)
Signed Right Shift (>>)	Shifts the bits of the left operand to the right by a number of positions specified by the right operand	# positive number 0101 (5) >> 0010 (2) ---- 0001 (1) # negative number 1111 1011 (-5) >> 0000 0010 (2) --------- 1111 1110 (-2)
Unsigned Right Shift (>>>)	Similar to the right shift operator, but it treats the value as an unsigned integer. It fills the vacant bits on the left with zeros	# positive number 0101 (5) >>> 0010 (2) ---- 0001 (1) # negative number 1111 0101 (-5) >>> 0000 0010 (2) --------- 0111 1111 1111 1111 1111 1111 1111 1110 (1073741822)