Represent (2748)10 as shapeless summit compute 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) Compute Arrangement

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

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

We shall embody a decimal compute with an optional suffix D if tortuousness arises.

1.2 Binary (Base 2) Compute Arrangement

Binary compute arrangement has couple symbols: 0 and 1, determined *bits*. It is too a *positional notation*, coercion sample,

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

We shall embody a binary compute with a suffix B. Some programming languages embody binary computes with preface 0b (e.g., 0b1001000), or preface b with the bits quoted (e.g., b’10001111′).

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

1.3 Hexadecimal (Base 16) Compute Arrangement

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

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

We shall embody a hexadecimal compute (in scanty, hex) with a suffix H. Some programming languages embody hex computes with preface 0x (e.g., 0x1A3C5F), or preface xwith hex digit quoted (e.g., x’C3A4D98B’).