Data Representation - Binary Shift (GCSE Computing)

The following is a GCSE Computing test covering 'Data Representation - Binary Shift'

Incorrect: 0

Correct: 0

Question 1

...

Congratulations - you have completed the test!

Your final score was

Below a typical questions that will be covered in this test. You final score will be logged on your account

If you left shift the 8-bit value 00111111 by 1, what 8-bit binary do you get (bits dropped if overflow)?

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?

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

What is the result of right shifting (logical) 00000011 by 1?

What is the result of logical right shifting 10000000 (8-bit) by 1?

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

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

Left shifting an 8-bit unsigned value by 1 commonly has the same effect as which arithmetic operation (when no overflow occurs)?

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

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

Which statement correctly distinguishes arithmetic right shift from logical right shift for signed numbers?

Similiar Tests