Which term is used for moving bits in a binary number to achieve arithmetic or logical shifts?

• A. Binary shift
• B. Two's complement
• C. Overflow
• D. Syntax

Answer: (A)

Moving bits in a binary number to perform arithmetic or logical shifts is called a binary shift. This bitwise operation involves sliding each bit to a new position: a left shift moves bits toward more significant positions, often filling the rightmost spaces with zeros; a right shift moves bits toward less significant positions, which can fill the leftmost spaces with zeros (logical shift) or with the sign bit to preserve negativity (arithmetic shift). This technique is fundamental for tasks like quick multiplication or division by powers of two and for various low-level manipulations of binary data. The other terms don’t describe the operation: two's complement is a way to encode signed numbers, overflow is when the result doesn’t fit the available number of bits, and syntax refers to programming language structure, not bit movement.