AQA GCSE Computer Science · 8525
Paper 2
Revise: Binary ShiftsA logical binary shift moves every bit a stated number of positions to the left or right. The boxes stay in place: it is their contents that move. Any bit pushed beyond the end is discarded, and every position left empty is filled with 0.
- Revise: Applications of Binary Shifts
An operation that moves every bit a specified number of positions left or right, fills vacated positions with zeros and discards bits moved beyond the available positions.