Question

On applying Left shift operator, <<, on integer bits are lost one they are shifted past which position bit?

(a) 1

(b) 32

(c) 33

(d) 31

I had been asked this question in an interview for job.

The doubt is from Bitwise Operators in chapter Operators and Control Statements of Java

Answer 1

Right option is (d) 31

Explanation: The left shift operator shifts all of the bits 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 the right. When a left shift is applied to an integer operand, bits are lost once they are shifted past the bit position 31.