Question

how do i convert a 128 bit binary number into a decimal number

Answer 1

depends on the codification. Generally the first half of bit codify the iinter portion and the second half the decimal.
Pay attetion that The number counts with a bit to determinate if it's positive or negative

Answer 2

Yeah, it really depends. The most common form of encoding a floating point number into a binary value is IEEE754. See http://en.wikipedia.org/wiki/IEEE_754 for the details of how that works (it's not trivial hehe).

Answer 3

why it should be floating point number?

Answer 4

No reason, but when it's not specified, that's often the case.

Answer 5

Fixed point is remarkably complicated, actually :)

Answer 6

i thought it will be just 101011010100...10101 128times but yeah it didn't say that

Answer 7

Or, rather, doing arithmetic with a fixed-point representation. I had to do that in a kernel library once upon a time. It's not extra extra hard, but it makes your brain bed in unusual ways. Then again, floating point is way crazier, it just tends to have hardware support ;)

Answer 8

When it's not specified and just a homework question, assume it's a positive integer; floating point is much much harder, and it would be have been mentioned in the question. Same goes for two's complement.

Let's try and help him solve the easy question, and if that's not sufficient, he'll tell us.

Answer 9

well i have to use muPAD to generate the two numbers

Answer 10

actually i should have asked this first, how do you get two prime binary numbers? and then convert it.

Answer 11

okay, so we can assume a positive integer. please ask about how to get a primary number in a separate thread.

Make sure to _always_ include the information that you're using muPad; otherwise people wilil give you a general algorithm or code in a popular language like C or Java. Of course, if you prefer getting the general algorithm, that's fine.