Data Representation - Binary Shift (GCSE Computing)

What happens to the most significant bit (MSB) when you perform a logical left shift by 1?

What happens to the least significant bit (LSB) when you perform a left shift by 1 on a binary value?

Which statement about shifting by more bits than the word size (e.g., shifting an 8-bit number by 10) is generally correct in fixed-width hardware?

Which is true about rotating (circular shift) vs logical shift?

When left shifting the 8-bit unsigned value 01010101 by 3 bits, what decimal value do you get (if bits shifted out are lost)?

Which of these best describes an overflow risk when left shifting fixed-width binary numbers?

What is the decimal result of left shifting the unsigned decimal 7 by 3 bits?

Which operation is equivalent to a left shift by n bits on an unsigned integer (if no overflow)?

What is the result of left shifting hexadecimal 0x12 by 1 bit (8-bit register), written in hex? (0x12 = 00010010)

Which of these is NOT a property of logical right shift on unsigned integers?

If an 8-bit signed two`s complement number is arithmetic right shifted by 1, what happens to the sign?