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

530 Valid Hostname Is Expected When Setting Up IIS 10 For Multiple Sites

Answer : Solution 1: When configured with two or more hostnames, the correct virtual host name and username must both be sent in the username by the ftp client. Separate the site name and user with the vertical line symbol: | www.example.com|MyUser So, in your FTP Client use this for the username: ftp.telefonievergelijken.nl|tv_ftp Solution 2: It appears that you're attempting to connect to the FTP site using a hostname which is not currently configured in any of the bindings to the FTP site within IIS. I base this only on the error output from Filezilla which you have included, as you have censored the hostname (even in example form) from the output, so there isn't much more to go on. You'll need to configure a binding on the FTP site which matches the hostname you are using to connect to the FTP site (whether that be from Filezilla or any other FTP client). EDIT: From your updated post information, I notice that your bindings for the FTP site are indeed in...
Read more

C Perror Example

Defined in header <stdio.h> void perror ( const char * s ) ; Prints a textual description of the error code currently stored in the system variable errno to stderr . The description is formed by concatenating the following components: the contents of the null-terminated byte string pointed to by s , followed by ": " (unless s is a null pointer or the character pointed to by s is the null character) implementation-defined error message string describing the error code stored in errno , followed by '\n' . The error message string is identical to the result of strerror ( errno ) . Parameters s - pointer to a null-terminated string with explanatory message Return value (none). Example # include <stdio.h> int main ( void ) { FILE * f = fopen ( "non_existent" , "r" ) ; if ( f == NULL ) { perror ( "fopen() failed" ) ; } else { fclose...
Read more

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