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 8-bit binary result of left shifting 00001000 by 1?

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

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

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

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

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

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?

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

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 value 00000101 is left shifted arithmetically by 2, what is the 8-bit result?

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

Similiar Tests