The left shift operator shifts all of the bite in a value to the left specified number of times. For each shift left, the high order bit is shifted out and lost, zero is brought in from right. When a left shift is applied to an integer operand, bits are lost once they are shifted past the bit position 31.

Unary not operator, ~, inverts all of the bits of its operand in binary representation.

The right shift operator automatically fills the higher order bit with its previous contents each time a shift occurs. This also preserves the sign of the value.

>>

Boolean

The controlling condition of ternary operator must evaluate to boolean.

Division operator, /, has equal precedence as of multiplication operator. In expression involving multiplication and division evaluation of expression will begin from right side when no brackets are used.

1 -> 2 -> 3

9

The operand of arithmetic operators can be any of numeric or character type, But not boolean.