Explain the bitwise operators available in Java with an example?

Answer 1

Java's bitwise operators operate on individual bits of integer (int and long) values. If an operand is shorter than an int, it is promoted to int before doing the operations. It helps to know how integers are represented in binary. For example the decimal number 3 is represented as 11 in binary and the decimal number 5 is represented as 101 in binary. Negative integers are store in two's complement form. For example, -4 is 1111 1111 1111 1111 1111 1111 1111 1100. == == & - and

| - or

^ - Xor

~ - not

<< - left shift

>> - right shift

>>> - right shift

Examples:

3 & 5 = 1 (1 if both bits are 1.)

3 | 5 = 7 (1 if either bits are 1) 3^5 = 6 (1 if both bits are different)

~3 = -4 (Inverts the bits)

3 << 2 = 12 (Shifts the bits of n left p positions. Zero bits are shifted into the low-order positions.)

5 >> 2 = 1 (Shifts the bits of n right p positions. If n is a 2's complement signed number, the sign bit is shifted into the high-order positions.)

-4 >>> 28 = 15 (Shifts the bits of n right p positions. Zeros are shifted into the high-order positions.)

{| !

!

!

!

!

|

|}