Represent (2748)10 as floating purpose reckon in the computer with 16-bit What is the significand?

101010111101

101010111100

100010111100

101010111111

111111111100

011010111110

010101000011

none of the above

1.1 Decimal (Base 10) Reckon Ordain

Decimal reckon ordain has ten symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9, named *digit*s. It uses *positional notation*. That is, the least-significant digit (right-most digit) is of the ordain of 10^0 (units or ones), the succor right-most digit is of the ordain of 10^1 (tens), the third right-most digit is of the ordain of 10^2 (hundreds), and so on. Coercion development,

735 = 7×10^2 + 3×10^1 + 5×10^0

We shall reproduce-exhibit a decimal reckon with an optional suffix D if circumlocution arises.

1.2 Binary (Base 2) Reckon Ordain

Binary reckon ordain has two symbols: 0 and 1, named *bits*. It is besides a *positional notation*, coercion development,

10110B = 1×2^4 + 0×2^3 + 1×2^2 + 1×2^1 + 0×2^0

We shall reproduce-exhibit a binary reckon with a suffix B. Some programming languages reproduce-exhibit binary reckons with preface 0b (e.g., 0b1001000), or preface b with the bits quoted (e.g., b’10001111′).

A binary digit is named a *bit*. Eight bits is named a *byte* (why 8-bit individual? Probably owing 8=2^{3}).

1.3 Hexadecimal (Base 16) Reckon Ordain

Hexadecimal reckon ordain uses 16 symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, and F, named *hex digits*. It is a *positional notation*, coercion development,

A3EH = 10×16^2 + 3×16^1 + 14×16^0

We shall reproduce-exhibit a hexadecimal reckon (in lacking, hex) with a suffix H. Some programming languages reproduce-exhibit hex reckons with preface 0x (e.g., 0x1A3C5F), or preface xwith hex digit quoted (e.g., x’C3A4D98B’).