After having spent a significant amount of time googling this topic, I am still struggling to confidently answer the following question:
Identify the process using logical operators to normalise a floating-point number.
My first assumption was, we use the binary shift to remove the leading 0's (for positive numbers) or 1's (for negative numbers) and then use XOR to increase the exponent by the required amount.
I do not understand, however, what happens to the binary point.
Let's say we have the number 1.75 represented as 000001.11 in 8-bits. If I shift it to the right by one place, I lose the 1 at the end. If I shift it to the left by 4 places, how does the computer know to move the binary point between the first two bits from the left? I am lost. How do bitwise operations work in this case?
Thank you in advance for your time and help.