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

When is an arithmetic right shift and a logical right shift guaranteed to produce the same result?
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 left logical shift by 1 on the binary value 00010110?
Which shift type preserves the sign bit for signed two’s complement numbers when shifting right?
Which statement best describes the effect of shifting an unsigned binary number one position to the left (logical left shift)?
Which operation would you use to remove (discard) the lowest n bits of a word and keep the higher bits, using shifts?
Given the 8-bit binary 01111111, what is the result after one logical left shift?
Which scenario is most likely to cause overflow (loss of a most significant bit) when using fixed-width 8-bit registers?
Which operation will NOT lose any bits from the 8-bit register and therefore preserves all bit information?
Which of these uses of shifting is common in low-level programming and embedded systems?
Which statement about rotating bits (circular shift) is true?