-
On applying Left shift operator, <<, on an integer bits are lost one they are shifted past which position bit?
-
- 32
- 31
- 33
- 1
- None of these
Correct Option: B
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 right. When a left shift is applied to an integer operand, bits are lost once they are shifted past the bit position 31.
