Answer plss

Given the following in 32-bit single-precision Floating-point number representation (IEEE-754) in normalized form, A:11000000010110100101010000000000 B:01000001100111001000101010000000  Find the sum of A and B (A+B) in IEEE-754 form

The decimal value -19.625 is equivalent to the IEEE single-precision representation (in hexadecimal starting with 0x... ) Blank 1

What is the biggest positive FP number (in Decimal) that can be represented in 16-bit format using 1-bit sign, 4-bit biased exponent, and 11-bit fraction, where bias is 7?

Assume numbers are represented in 8-bit twos complement representation. Show the calculation of 11000011 - 11101000. It's 195 minus 232, but I don't get how to solve it when the second number is a higher value than the first. How do I subtract this?

In a particular computer system, real numbers are stored using floating-point representation with:• 10 bits for the mantissa• 6 bits for the exponent• two’s complement form for both mantissa and exponent. (a) Calculate the normalised floating-point representation of +192.5 in this system. Show your working.

Briefly explain why two’s complement is the best format for representing signed integers in a computer.

Given two 32-bit single-precision Floating-point number representation (IEEE-754) in normalized form, Give their sum (A+B) in IEEE-754.    A: 11000000010110100101010000000000 B: 11000000010110100101010000000000

What is the 16-bit FP number representation of -7.375 in hex with 1-bit sign, 4-bit biased exponent, and 11-bit fraction, where bias = 7. Please identify the key components of FP number representation