two’s complement arithmetic : Java Glossary

* 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all)

two’s complement arithmetic: Java internally uses (or emulates) two’s complement arithmetic. Positive numbers are stored in binary. That means that for example the number 13 would be written 0x0d = 00001101 = 1*8 + 1*4 + 0*2 + 1*1. The high order bit is called the sign bit. For signed quantities such as byte, short, int and long, when that high order bit is a 1, we consider the number negative. To represent a negative number we first invert each bit, then add 1. We would write -13 this way: 0x0d - ⇒ 00001101 ⇒ 11110010 ⇒ 11110011 ⇒ 0xf3. Whenever you do any operation on a byte, it is first sign extended to an int. So so 13 ⇒ 0x0d ⇒ 00001101 ⇒ 00000000000000000000000000001101 ⇒ 0x0000000d and -13 ⇒ 0xf3 ⇒ 11110010 ⇒ 11111111111111111111111111110010 ⇒ 0xfffffff3. When you do arithmetic the results can be too big to represent. The arithmetic is done modulo 2 to the 32 ^nd power, which is a fancy way of saying the high order bits of the result are discarded. The overflow may turn on the high order bit, making the result look negative. Don’t confuse two’s complement with two’s compliment an activity you do in the back seat of a car in an attempt to talk someone out of their clothes.
binary
one’s complement arithmetic
unsigned
~

standard footer
	This page is posted on the web at:	http://mindprod.com/jgloss/twoscomplement.html
	Optional Replicator mirror of mindprod.com on local hard disk J:	J:\mindprod\jgloss\twoscomplement.html
	Please read the feedback from other visitors, or send your own feedback about the site. Contact Roedy. Please feel free to link to this page without explicit permission.
	Canadian Mind Products IP:[65.110.21.43] Your face IP:[3.135.201.101]
Feedback	You are visitor number