Question

Which is the correct checksum of 1001001110010011 and 1001100001001101 (16 bit segment) ? a. 1101010000011110 b. 1101010000111111 c. 1010101000011111 d. 1011111000100101

Answer 1

To find the correct checksum of two 16-bit segments, convert the binary numbers to decimal, add them together, convert the sum back to binary, and invert the bits.

Step-by-step explanation:

To find the correct checksum of two 16-bit segments, we need to perform a bitwise XOR operation on the two segments. Here are the steps:

1. Convert the two binary segments, 1001001110010011 and 1001100001001101, into decimal numbers, 38987 and 38861, respectively.
2. Add the two decimal numbers together: 38987 + 38861 = 77848.
3. Convert the decimal sum back into a binary number: 77848 = 10011000111011000.
4. Invert all the bits of the binary sum: 01100111000100111.

The correct checksum of 1001001110010011 and 1001100001001101 is 01100111000100111, which is option d. 1011111000100101.

Answer 2

The correct checksum is: 1101010000111111

How to solve

To find the checksum of 16-bit segments 1001001110010011 and 1001100001001101, perform a bitwise addition (XOR) of the two segments.

1001001110010011

XOR 1001100001001101

0000101111011110

The correct checksum is: 1101010000111111