Explore

Binary Arithmetic Flashcards
OCR GCSE J277 Computer Science specification
Ready to master these flashcards?
Sign in to study with spaced repetition and track your progress.
Sign In to Track ProgressTerms in this set (10)
Binary addition
The process of adding binary numbers together, following the rules: 0+0=0, 0+1=1, 1+0=1, 1+1=10 (carry 1).
Overflow error
Occurs when the result of a binary addition exceeds the number of bits available to store it.
Binary shift
A method of multiplying or dividing binary numbers by shifting the bits left or right.
Left binary shift
Shifts all bits to the left, effectively multiplying the number by 2 for each shift.
Right binary shift
Shifts all bits to the right, effectively dividing the number by 2 for each shift.
Effect of left shift
Increases the value of the binary number but may cause overflow if bits are lost.
Effect of right shift
Decreases the value of the binary number but may lose precision if bits are lost.
Carry in binary addition
When adding two binary digits results in a sum of 10, the 1 is carried to the next column.
Binary addition example
Adding 1010 and 1101 results in 10111 (carry applied where necessary).
Purpose of binary arithmetic
Used in computers to perform calculations and process data efficiently using binary numbers.

Want to Learn More?
Get personalised lessons, quizzes, and instant feedback from your AI tutor.
Start Learning