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

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

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

What is the 8-bit binary result of left shifting 00001000 by 1?

What is the 8-bit result of arithmetic right shifting 11100000 by 2?

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)

If you right shift a positive binary number by 1 using arithmetic shift, what is the usual arithmetic effect (ignoring remainder)?

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

What bit value is shifted in on the right when performing a logical right shift on a binary number?

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

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?

Similiar Tests