Login
Login
Login
Register

Tutor HuntTest QuestionsComputing QuestionsYear 10 Computing Questions

 

Binary Shift (GCSE Computing)

The following is a GCSE Computing test covering 'Binary Shift' from the broader topic 1. Data Representation. The test is geared towards the CAMBRIGE-IGCSE exam board style syllabus.
Start Test
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

Why are shifts often preferred for multiplying or dividing by powers of two in performance-critical code?
What is the 8-bit result of performing a logical right shift by 1 on the binary value 10010100?
When is an arithmetic right shift and a logical right shift guaranteed to produce the same result?
Which statement best describes the effect of shifting an unsigned binary number one position to the left (logical left shift)?
Treating 8-bit two’s complement, what is the decimal result of arithmetic right shifting 11000000 (which represents -64) by 1?
If you circularly rotate the 8-bit value 00000001 right by 1 (circular right rotate), what is the result?
Which of the following is the common name for the CPU instruction that shifts bits left logically on many architectures?
What is the result of rotating the 8-bit value 10110011 left by 1 (circular left rotate by 1)?
Which of these uses of shifting is common in low-level programming and embedded systems?
Which of the following is FALSE about using bit shifts on integers?
Which operation will NOT lose any bits from the 8-bit register and therefore preserves all bit information?