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

Which of the following is the common name for the CPU instruction that shifts bits left logically on many architectures?
Which scenario is most likely to cause overflow (loss of a most significant bit) when using fixed-width 8-bit registers?
How can you test whether the nth bit (0 = LSB) of an integer value v is set to 1 using shifts and bitwise AND?
Which statement best describes the effect of shifting an unsigned binary number one position to the right (logical right shift)?
Which statement about rotating bits (circular shift) is true?
If you circularly rotate the 8-bit value 00000001 right by 1 (circular right rotate), what is the result?
Given the 8-bit binary 01111111, what is the result after one logical left shift?
In many programming languages (for example C), which operator is used for left bit shifting?
Why might a programmer choose to use bit shifting instead of multiplication or division by a power of two?
What is the key difference between a logical right shift and an arithmetic right shift on signed numbers?
What is the 8-bit result of performing a logical right shift by 1 on the binary value 10010100?