Logical Binary Shifts

Binary Shift

A process that moves all bits in a binary number to the left or right by a specified number of places, filling empty spaces with zeros.

Left Shift Operator

The operator '<<' is used to shift bits to the left.

Right Shift Operator

The operator '>>' is used to shift bits to the right.

Effect of Left Shift

Shifting a binary number left is equivalent to multiplying that number by 2 for each shift.

Effect of Right Shift

Shifting a binary number right is equivalent to dividing that number by 2 for each shift.

Overflow in Shifts

When bits are shifted out during a shift operation, they are ignored.

Infill with Zeros

Gaps created by shifting bits are filled with zeros.

Precision Issue in Division

Dividing odd numbers using right shifts can lead to loss of precision, as fractional parts cannot be represented in binary.

Convert Binary to Decimal

The process of changing a binary number into its decimal (denary) equivalent.

Example of Left Shift

Shifting the binary number 11010110 to the left by 1 gives 10101100.

Example of Right Shift

Shifting the binary number 11010110 to the right by 2 gives 00110101.