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

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

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

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

What is the result (in decimal) of logically right shifting unsigned decimal 200 by 2? (200 = 11001000)

An 8-bit unsigned value 11110000 is right shifted logically by 4. What is the 8-bit result?

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

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

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

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

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?

Similiar Tests