In an arithmetic left shift, the value of the number is effectively multiplied by for each shift operation.

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

In a logical shift, the vacant positions are usually filled with .

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