Download CS601 assignment 2 solution for spring 2023. It contain complete solution for questions opened in assignment CS601.

For more assignments visit

## SOLUTION # 1

Pair of words | Hamming Distance |

d (10111,1100) | 2 |

d (1101,10101) | 1 |

d (10100,00010) | 3 |

d(1110,0111) | 2 |

d (010,10000) | 2 |

## Solution #2

To compute an 8-bit checksum for the given data bits, we will follow the following steps:

- Divide data bits into group of 8 bits:

Original data bits:

**10111011010010111011010101110100**

Divided into groups:

**10111011010010111011010101110100**

2. Add each group of 8 bits together using binary addition:

**10111011 + 01001011 + 10110101 + 01110100 **

Intermediate Sums:

**10111011 + 01001011 = 100100010**

**1000000 + 10110101 = 100111011**

**100111011 + 01110100 = 1001101011**

3. If the sum obtained in step 2 has more than 8 bits, fold the extra carry bits back into the sum until it is reduced to 8 bits.

1001101011 = 00011011 (carry is folded back)

4. Take the 1’s complement of the final sum obtained in step 3.

00011011 -> 11100100

5. This 1’s complement is the 8-bit checksum that the sender will send along with the original data bits.

**Checksum = 11100100**