Binary Shift (GCSE Computing)

What is the decimal result of performing an unsigned logical right shift of 52 by 2 positions (52 >> 2)?

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

Which statement about rotating bits (circular shift) is true?

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 of these uses of shifting is common in low-level programming and embedded systems?

Why are shifts often preferred for multiplying or dividing by powers of two in performance-critical code?

If you circularly rotate the 8-bit value 00000001 right by 1 (circular right rotate), what is the result?

Treating 8-bit two’s complement, what is the decimal result of arithmetic right shifting 11000000 (which represents -64) by 1?

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

Which operation would you use to remove (discard) the lowest n bits of a word and keep the higher bits, using shifts?

What is the decimal result of shifting the unsigned integer 13 left by 2 positions (13 << 2)?