Decode the following bit pattern using 32-bit floating point format?

We have to start from left to right.

The first bit is the sign bit. Since it is a 1, we know it is negative.

The next 8 bits make up the exponent, which you have to subtract 127 from. 10000100 is 132. 132-127 is 5, so 5 is our exponent.

The remaining 23 bits make up the last part of our number. You write down until you reach the last 1, starting from left to right. Our 23 remaining bits are: 000111...0. Since we right until we reach the last 1 bit, we are left with 000111.

Our format for converting to decimal from floating point is:

1.blahblahblah * 2^exponent-127

That means our number is

-1.000111*2^5

Note that the -1.000111 is still in binary, and that you have to convert it to decimal. To convert the bits to the right of the decimal point, you would have to do:

(2^-4)+(2^-5)+(2^-6)=.109375

We now have -1.109375*2^5 which equals -35.5

It relies upon on what floating factor notation you're utilising. IEEE is the main conventional, yet there are others. besides, this looks like homework and you're able to desire to do your individual homework.