Do we need to check for mantissa overflow in floating point multiplication?
When we multiply, the answer is stored in 2 registers. When we multiply 2 numbers the results length does not exceed  ($n_1+n_2$) where $n_1$ is length of 1st number and $n_2$ is length of second number. So there is no chance of overflow here as the length of 2 registers is greater than or equal to $n_1+n_2$.