Αποτελέσματα Αναζήτησης
22 Μαΐ 2014 · How to convert a binary String such as String c = "110010"; // as binary to the value in decimal in Java? (expected result in the example is 50)
3 Ιουν 2023 · divide intVal by two, rounding down. return strVal. which will construct your binary string based on the decimal value. Just keep in mind that's a generic bit of pseudo-code which may not be the most efficient way of doing it though, with the iterations you seem to be proposing, it won't make much difference.
20 Αυγ 2010 · 2. For the sake of completion: if you want to convert fixed point representation to its binary equivalent you can perform the following operations: Get the integer and fractional part. from decimal import *. a = Decimal(3.625) a_split = (int(a//1),a%1) Convert the fractional part in its binary representation.
9 Σεπ 2012 · I have a simple code to convert binary to decimal numbers. In my compiler, the decomposition works just fine for number less than 1000, beyond the output is always the same 1023.
25 Δεκ 2009 · A good way to go about this is to keep taking modulo (%) 10 (because decimal is base 10) of the binary value until we reach 0. Furthermore it would also be good to track the sum & the position at which we are at.
28 Αυγ 2016 · Using int with base is the right way to go. I used to do this before I found int takes base also. It is basically a reduce applied on a list comprehension of the primitive way of converting binary to decimal ( e.g. 110 = 2**0 * 0 + 2 ** 1 * 1 + 2 ** 2 * 1)
The Python package Binary Fractions has a full implementation of binaries as well as binary fractions. You can do your operation as follows: from binary_fractions import Binary b = Binary(6) # Creates a binary fraction string b.lfill(8) # Fills to length 8 This package has many other methods for manipulating binary strings with full precision.
16 Μαρ 2021 · Convert binary sequence string to Array (assuming it wasnt already passed as array) Reverse sequence to force 0 index to start at right-most binary digit as binary is calculated right-left 'reduce' Array function traverses array, performing summation of (2^index) per binary digit [only if binary digit === 1] (0 digit always yields 0)
31 Ιαν 2012 · You can start from either end. Say you had a 16 bit number 12345 (0x3039). The first way would be. divide by 10000 result is 1 remainder 2345 save or print the 1. divide by 1000 result is 2 remainder 345 save or print the 2. divide by 100 result is 3 remainder 45 save or print the 3. divide by 10 result is 4 remainder 5 save or print the 4 and 5.
16 Φεβ 2012 · Since you already figured out that this is (in binary)1.1001*10^-100, now you just have to convert the binary number to decimal. In decimal, each digit has a value one-tenth as much as the one before it. In binary, each digit has a value one-half as much as the one before it. First 1.1001*10^-100 = 0.00011001. Which is...
