Converting Negative Decimal To Binary


Answer :

You're confused because you forgot that there must be something that distinguishes positive numbers from negative ones.



Let's say you want to store non-negative numbers on 8 bits.




  • 00000000 is 0,

  • 00000001 is 1,

  • 00000010 is 2,

  • 00000011 is 3,

  • 00000100 is 4,

  • ...

  • 11111111 is 255



So you can store numbers in range 0-255 on 8 bits. 255 = 28 - 1. (2 is the base of binary system, 8 is the number of bits, 1 is subtracted because we want to count 0 in)



Now, let's say you want to store negative numbers too. How can we achieve that? We can dedicate one bit for sign. If this bit is 0 then we interpret other 7 bits as a positive number, otherwise as a negative number. It's best to use most significant bit for sign because it makes some operations easier.




  • Trivial approach: Just read a number as-is:




    • 00000001 == 1 and 10000001 == -1

    • 01000010 == 66 and 11000010 == -66

    • 01111111 == 127 and 11111111 == -127


  • Ones' complement: For any number x, negating its binary representation yields binary representation of -x. This means that:




    • 00000001 == 1 and 11111110 == -1

    • 01000010 == 66 and 10111101 == -66

    • 01111111 == 127 and 10000000 == -127


  • Two's complement: For any number x, negating its binary representation and adding 1 yields binary representation of -x. This means that:




    • 00000001 == 1 and 11111111 == -1

    • 01000010 == 66 and 10111110 == -66

    • 01111111 == 127 and 1000001 == -127

    • 10000000 == -128




Why is two's complement the best?




  • Because it has the widest range: -128...127, while trivial approach and ones' complement have -127...127

  • Zero is well defined:


    • In two's complement only 00000000 is zero

    • In trivial approach both 00000000 and 10000000 are zero

    • In ones' complement both 00000000 and 11111111 are zero


  • Addition and subtraction is identical as with unsigned numbers, so CPU doesn't need additional instructions for adding signed numbers.



Note that if we dedicate most significant bit for sign bit, then we can't convert number to binary without knowing how many bits we will need. For example is we have 4 bits, then the number -5 in trivial approach is 1101, on 7 bits it would be 1000101. 0001101 (4-bit -5 padded with zeros to 7 bits length) is actually 13 (most significant bit is 0, so it's positive).



I won't do the homework for you, but I can give you general tips:



To convert -x to N bits long two's complement representation:




  1. Convert -x to binary using two's complement.

  2. Left-pad it with zeros up to N-1 length.

  3. Add the negative sign bit on the left side.



I think you can figure out the rest from this answer. If you have any more questions, leave a comment.



Comments

Post a Comment

Popular posts from this blog

Converting A String To Int In Groovy

Answer : Use the toInteger() method to convert a String to an Integer , e.g. int value = "99".toInteger() An alternative, which avoids using a deprecated method (see below) is int value = "66" as Integer If you need to check whether the String can be converted before performing the conversion, use String number = "66" if (number.isInteger()) { int value = number as Integer } Deprecation Update In recent versions of Groovy one of the toInteger() methods has been deprecated. The following is taken from org.codehaus.groovy.runtime.StringGroovyMethods in Groovy 2.4.4 /** * Parse a CharSequence into an Integer * * @param self a CharSequence * @return an Integer * @since 1.8.2 */ public static Integer toInteger(CharSequence self) { return Integer.valueOf(self.toString().trim()); } /** * @deprecated Use the CharSequence version * @see #toInteger(CharSequence) */ @Deprecated public static Integer toInteger(String self) { return toInteg
Read more

"Cannot Create Cache Directory /home//.composer/cache/repo/https---packagist.org/, Or Directory Is Not Writable. Proceeding Without Cache"

Answer : if anyone pass through here, this is shorter solution: sudo chown -R $USER $HOME/.composer it seems to me the group information is missing in your command sudo chown -R <user> /home/<user>/.composer/cache/repo/https---packagist.org Shoud be sudo chown -R <user>:<group> /home/<user>/.composer/cache/repo/https---packagist.org But to avoid other permission issues, I would rather advise: sudo chown -R <user>:<group> /home/<user>/.composer/cache (you'll need access to other folders in there) and sudo chown <user>:<group> /home/<user>/.composer To make sure your user has permissions enough on the global composer folder. Mind the missing recursion so the user don't own keys created by root. If you need to find out the group: groups <user>
Read more

Android How Can I Convert A String To A Editable

Answer : As you probably found out, Editable is an interface so you cannot call new Editable() . However an Editable is nothing more than a String with Spannables, so use SpannableStringBuilder: Editable editable = new SpannableStringBuilder("Pass a string here"); If you only want to change the Spannables, never the text itself, you can use a basic SpannableString. Use Editable.Factory.getInstance().newEditable(str) From the android documentation: Returns a new SpannedStringBuilder from the specified CharSequence. You can override this to provide a different kind of Spanned.
Read more