Question
On applying Left shift operator, <<, on an integer bits are lost one they are shifted past which
position bit
On applying Left shift operator, <<, on an integer bits are lost one they are shifted past which
position bit
Answer: Option D
Was this answer helpful ?
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.
Was this answer helpful ?
More Questions on This Topic :
Question 2.
Which of these have highest precedence?
....
Question 8.
Which of these is not a bitwise operator?
....
Latest Videos
Latest Test Papers
Submit Solution