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
(a) 1
(b) 32
(c) 33
(d) 31
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.