Computer Science : S1 : L5 : Binary Shifts

Logical binary shift

The process of shifting all binary numbers in a stored register one or more places to the left or right.

Left shift

Shifting binary numbers to the left, resulting in multiplication by powers of 2 (e.g., *2 for one place, *4 for two places).

Right shift

Shifting binary numbers to the right, resulting in division by powers of 2 (e.g., /2 for one place, /4 for two places).

Empty spaces

When shifting, any vacant positions are filled with zeros (0).

Loss of highest number

During a logical binary shift, the highest number in an 8-bit register is lost.

Binary shifts for multiplication and division

Binary shifts are used to multiply or divide positive integers.

Integrity and correctness

Binary shifts have limitations as they can only be used up to a certain number, as losing vital information can lead to incorrect results.