Edexcel GCSE Computer Science
3.1.2: understand how computers represent and manipulate numbers (unsigned integers, signed integers (sign and magnitude, two's complement))
3.1.2: understand how computers represent and manipulate numbers (unsigned integers, signed integers (sign and magnitude, two's complement))
| Keyword | Definition |
|---|---|
| integer | a whole number (e.g. -5) |
| LSB | the bit on the right that is worth 1. |
| Magnitude | the size of a number, regardless of whether it is positive or negative |
| MSB | the bit on the left that is worth the most or indicates the sign of a negative number |
| Sign | whether a number is positive or negative |
| Sign and magnitude | a method of representing positive or negative numbers using binary data. Doesn't work for binary addition and has two values for zero. |
| signed | a number that can be positive or negative |
| Two's complement | a method of representing positive or negative numbers using binary data. Works for binary addition and only has one value for zero. |
| unsigned | a number that can only ever be positive |
| Unsigned integer | a method of representing positive whole numbers using binary data. Start with a bit worth one on the right then double the value of each bit as you move to the left |
