Data Representation - Binary Shift (GCSE Computing)

What 8-bit result do you get by logically right shifting 01000001 by 3 bits?

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?

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

Which is a correct effect of shifting a binary value right logically by n bits?

If an 8-bit value 00000101 is left shifted arithmetically by 2, what is the 8-bit result?

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?

If an 8-bit two`s complement number 11111100 is arithmetic right shifted by 1, what is the resulting 8-bit two`s complement binary?

An 8-bit two`s complement number 10010110 is arithmetic right shifted by 3. What is the resulting 8-bit binary?

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

What is the decimal result of arithmetic right shifting the two`s complement 8-bit value 11111000 by 2? (11111000 = -8)