Binary Shifts | Computer for GCSE/IGCSE - Year 11 PDF Download

Binary Shifts

• A binary shift involves multiplying or dividing binary numbers.
• In a binary shift, all bits in a binary number are moved a certain number of positions to the left or right.
• During a logical binary shift to the left, bits shifted from the end are lost, and zeros fill in at the opposite end.
• Conversely, during a logical binary shift to the right, bits shifted from the beginning are lost, and zeros fill in at the opposite end.
• When performing a logical binary shift, a positive binary integer is multiplied or divided based on the shift direction. Shifting left is akin to multiplying by a power of 2, while shifting right is akin to dividing by a power of 2.
• In a logical binary shift, either the most significant bit(s) or least significant bit(s) are lost, depending on the shift direction.

Binary Shift Walkthrough

• When you shift a binary number to the left or right, you are essentially multiplying or dividing it by a power of 2.
• Shifting the binary number 11001100 to the left by two positions results in 00110000. The two bits shifted from the end are lost, and two zeros are added at the opposite end.
• For example, shifting 11001100 to the left by two positions is equivalent to multiplying it by 2 raised to the power of 2 (4). The result, 00110000, is four times the original value.
• On the other hand, shifting the same binary number to the right by two positions gives 00110011. The two bits shifted from the beginning are lost, and two zeros are added at the opposite end.
• Shifting 11001100 to the right by two positions is akin to dividing it by 2 raised to the power of 2 (4). The result, 00110011, is equal to the original value divided by 4.