Timeline for Signed and unsigned numbers
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2019 at 2:32 | vote | accept | penguin99 | ||
| May 15, 2019 at 2:32 | |||||
| Mar 15, 2019 at 16:23 | history | edited | Draconis | CC BY-SA 4.0 |
added 168 characters in body
|
| Mar 12, 2019 at 15:37 | comment | added | Rudy Velthuis | Multiplication often has signed and unsigned varieties: 0xFFFFFFFF * 0xFFFFFFFF is 0xFFFFFFFE00000001 if unsigned and 0x0000000000000001 if signed. Processors like Intel's return the result in 2 registers, and the top register does differ for signed and unsigned. The bottom register is 1 in both situations. | |
| Mar 11, 2019 at 22:20 | history | edited | Draconis | CC BY-SA 4.0 |
added 390 characters in body
|
| Mar 11, 2019 at 21:01 | comment | added | Daniel Schepler |
There's also comparison: < <= >= > are different for signed vs. unsigned operands whereas == and != are signedness-agnostic.
|
|
| Mar 11, 2019 at 7:04 | comment | added | Ruslan | In two's complement representation three arithmetic operations are signedness-agnostic: addition, subtraction and multiplication (with product of the same length as operands). Only division has to be handled differently for signed operands. | |
| Mar 10, 2019 at 15:40 | history | answered | Draconis | CC BY-SA 4.0 |