• Aug 10th 2010, 11:14 PM
anderson
hi everyone,

need help to check my working for this questions,.really appreciate all your kind help & support.

Represent the following numbers with the IEEE754 standard; -5, 9 and 0.23,2.5, 32.9
-5=1.25x2^2 = 1100 0000 1010 0000 0000 0000 0000 0000=C0A00000
9 = 1.125X2^2=0100 0001 0001 0000 0000 0000 0000 0000=41100000
0.23=1.84X2^(-3)= 0011 1110 0110 1011 1000 0101 0001 1111 = 3E6B851E
2.5 = 1.25 x 2 = 0100 0000 0010 0000 0000 0000 0000 0000 = 40200000
32.9 = 1.028125 x 2^5 = 01000010 00000011 10011001 10011010 = 42039999

b) Is this Boolean simplification correct
F = {(X+Y)' . (Y+Z')' }'

Now From the De'Morgan Theorem : (A.B)' = A' +B'

We can write : F = {(X+Y)'}' + {(Y+Z')'}'

Now the Involution Theorem : (A')' =A

We can write : F = (X+Y) + (Y+Z')

F = X +Y +Y + Z'

=) F = X + Y + Z' ......{ From Idempotency : Y + Y =Y }

Thank you for your help & support.
• Aug 11th 2010, 02:49 AM
Ackbeet
Your part b) looks correct to me. For part a), it looks good to me. Incidentally, before this post, I had no idea what IEEE754 was. I ended up finding this site. Evidently you're converting to unrounded numbers. So now you can check your own work, eh?
• Aug 11th 2010, 11:54 AM
Ackbeet
Hmm. That last comment didn't come across the way I intended it. I mean you can check conversions from IEEE754 to regular decimal representation and back using the online tool. I didn't mean that you can't use this forum to help you check your work. That's a lot of what this forum is for, after all!