Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.
Shade in the A or B circle for each question.
Draw a line connecting each item on the left to its match on the right.
| Left column | Right column | |
|---|---|---|
| 100000101 << 3 | ABinary shifts cannot make fractions. The remainder is dropped, so 13 / 4 gives 3 (00000011), not 3.25. | |
| 200010100 >> 2 | BShifts right 2 places, dividing 20 by 2^2 (4) to give 5 (00000101) | |
| 3A right shift by 2 divides by 4 and drops the remainder, so 15 becomes 3 | C11000000 << 1 = 10000000 | |
| 4A left shift loses the answer if a 1 is shifted off the end of the 8-bit register | DOnly shifted left 2 places, which multiplies by 4. Shifting left 3 places multiplies by 8, so the answer is 24 (00011000). | |
| 500000011 << 3 = 00001100 (3 x 8 = 12) | EShifts left 3 places, multiplying 5 by 2^3 (8) to give 40 (00101000) | |
| 600001101 >> 2 = 00000011.25 (13 / 4) | F00001111 >> 2 = 00000011 |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
n shifts = 2^n — Each left shift multiplies a binary number by 2 and each right shift divides it by 2, so n shifts multiply or divide by 2^n. Bits shifted off the end are lost.Left shift by 3 multiplies by 8Right shift by 2 divides by 400000110 << 3 = 0011000013 >> 2 is 13 / 4 = 3 remainder 110000001 << 1 = 00000010, so the 1 is lost