Link1 (http://www.amazon.com/Structures-Algorithms-Addison-Wesley-Computer-Information/dp/0201000237/ref=sr_1_1?ie=UTF8&s=books&qid=1247645039&sr=1-1) Link2...

This may help you, if you want to use Java:
http://www.sap-img.com/java/java-bitwise-shift-operators.htm

You can use binaries. Start with 000...0, then shift your binary left and add 1 and so on. So you get e.g.:
0000
0001 (shift left --> 0010 plus 1 --> 0011)
0011
0111
1111
You only have to...

What have you done by now?
We can help you, but I assume, that no one writes the hole program for you. So try by yourself und ask about concrete problems.

e.g.: 0.25
0.25 * 2 = 0.5 --> 0*2^(-1)
0.5 * 2 = 1.0 --> 1*2^(-2)
--> (0.25)decimal = (0.01)binary