# Fill in the following table to show how the given integers are represented, assuming that 16 bits are used to store values and the machine uses two’s complement notation.IntegerBinaryHex4-Byte Big Endian (Hex value as seen in memory)4-Byte Little Endian (Hex value as seen in memory)28    2216    −18675    −12    31456

Question
521 views

Fill in the following table to show how the given integers are represented, assuming that 16 bits are used to store values and the machine uses two’s complement notation.

 Integer Binary Hex 4-Byte Big Endian (Hex value as seen in memory) 4-Byte Little Endian (Hex value as seen in memory) 28 2216 −18675 −12 31456
check_circle

Step 1

Convert the integer value to binary:

For positive integer:

Divide the integer number by 2. The integer quotient obtained is for the next iteration, and the remainder is for the binary digit. Repeat these steps until the quotient becomes 0.

For negative integer:

Convert the integer number into binary using the above-mentioned steps. Flip all the bits of the resulting binary number and add 1 to the flipped binary number to get signed binary number using 2’s complement.

Convert the integer value to Hex:

Take the binary number obtained in the previous steps. Starting from least significant bit take binary digi...

### Want to see the full answer?

See Solution

#### Want to see this answer and more?

Solutions are written by subject experts who are available 24/7. Questions are typically answered within 1 hour.*

See Solution
*Response times may vary by subject and question.
Tagged in

### Computer Science 