Binary Shift (GCSE Computing)

An 8-bit register contains 00101101 (decimal 45). If you perform a left shift by 3 positions in an 8-bit register (dropping overflow bits), what 8-bit binary result and decimal value remain in the register?

Which shift treats the value purely as a pattern of bits and always fills new high bits with zero when shifting right?

Which of the following best describes a logical left shift applied to an unsigned 8-bit number?

Which of these uses of shifting is common in low-level programming and embedded systems?

Which statement best describes the effect of shifting an unsigned binary number one position to the right (logical right shift)?

Which scenario is most likely to cause overflow (loss of a most significant bit) when using fixed-width 8-bit registers?

Which of the following is FALSE about using bit shifts on integers?

Given the 8-bit binary 01111111, what is the result after one logical left shift?

Why might a programmer choose to use bit shifting instead of multiplication or division by a power of two?

Which statement best describes the effect of shifting an unsigned binary number one position to the left (logical left shift)?

Which operation will NOT lose any bits from the 8-bit register and therefore preserves all bit information?