Arithmetic right shift is a division operation that effectively divides the number by for each shift.

Arithmetic right shift is performed on signed numbers where the leftmost bit represents the of the number.

Logical shifts are often used in computer programming to manipulate numbers.

When performing a logical shift to the left, the most significant bit is moved out and the least significant bit is filled with a .

In arithmetic left shift, the bits that are shifted out are lost and the spaces at the right end are filled with .

Binary underflow occurs when the result of a calculation is too small to be represented in the allocated .