Presentation is loading. Please wait.

Presentation is loading. Please wait.

Theory: 2.6 – Data Representation

Similar presentations


Presentation on theme: "Theory: 2.6 – Data Representation"— Presentation transcript:

1 Theory: 2.6 – Data Representation
Binary Addition

2 Rules of binary addition
= 0 = 1 = 0 carry 1 (2) = 1 carry 1 (3) If the answer to the addition does not fit in 8 bits, the last carry bit causes an overflow error. You can check your answers by converting the numbers.

3 Example + 1 1 1 1 1 If there is a carry bit left over, it is called an overflow error… …and you get the wrong answer. Zero + zero + carry = one Zero + one + carry = zero carry 1 Zero + one + carry = zero carry 1 One + one + carry = one carry 1 Zero + one = one Zero + zero = zero One + one = 0 carry 1 One + one = 0 carry 1

4 Lets have a go together +

5 Lets have a go together +

6 Lets have a go together +

7 Lets have a go together +

8 Overflow errors A CPU with a capacity of 8 bits has a capacity of up to in binary. If one more bit was added there would be an overflow error. Example: 8-bit overflow An example of an 8-bit overflow occurs in the binary sum (denary: ). The total is a number bigger than 8 digits, and when this happens the CPU drops the overflow digit because the computer cannot store it anywhere, and the computer thinks = 0. Overflow errors happen when the largest number that a register can hold is exceeded. The number of bits that it can handle is called the word size. Most CPUs use a much bigger word size than 8 bits. Many PCs have a 64-bit CPU. A 64-bit CPU can handle numbers larger than 18 quintillion (18,446,744,073,709,551,615 to be precise).


Download ppt "Theory: 2.6 – Data Representation"

Similar presentations


Ads by Google