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

An arithmetic right shift by 1 is applied to the two’s complement 8-bit value 10010100. What is the resulting 8-bit value?
What is the 8-bit result of performing a logical right shift by 1 on the binary value 10010100?
What is the decimal result of performing an unsigned logical right shift of 52 by 2 positions (52 >> 2)?
When is an arithmetic right shift and a logical right shift guaranteed to produce the same result?
In many programming languages (for example C), which operator is used for left bit shifting?
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 about rotating bits (circular shift) is true?
Given the 8-bit binary 01111111, what is the result after one logical left shift?
What is the key difference between a logical right shift and an arithmetic right shift on signed numbers?
Which of the following is the common name for the CPU instruction that shifts bits left logically on many architectures?
Why are shifts often preferred for multiplying or dividing by powers of two in performance-critical code?