0% found this document useful (0 votes)
10 views2 pages

CS601 Assignment2 Solution

The document contains an assignment solution for CS601 on Data Communication for Spring 2025. It includes a checksum calculation for five 4-bit binary numbers resulting in a decimal value of 6, and a Hamming distance table showing distances between pairs of binary words. The final answers are summarized at the end of the document.

Uploaded by

drmahnoor259
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views2 pages

CS601 Assignment2 Solution

The document contains an assignment solution for CS601 on Data Communication for Spring 2025. It includes a checksum calculation for five 4-bit binary numbers resulting in a decimal value of 6, and a Hamming distance table showing distances between pairs of binary words. The final answers are summarized at the end of the document.

Uploaded by

drmahnoor259
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Solution: CS601 – Data

Communication (Spring 2025)


Student Name: __________________

Student ID: __________________

Semester: Spring 2025

Assignment No.: 02

Question 1: Checksum Calculation


We are given five 4-bit binary numbers:

- Group 1: 0100
- Group 2: 0011
- Group 3: 1000
- Group 4: 1001
- Group 5: 1100

Let’s add them step-by-step:

1. 0100 + 0011 = 0111


2. 0111 + 1000 = 1111
3. 1111 + 1001 = 11000 → Since it’s a 5-bit result, we wrap the leftmost bit (carry) around:
- 1000 (lower 4 bits) + 1 (carry) = 1001
4. 1001 + 1100 = 10101 → Again, wrap the carry:
- 0101 (lower 4 bits) + 1 (carry) = 0110

So, the 4-bit checksum is 0110.

Answer in Decimal:
0110 = 6

Question 2: Hamming Distance Table


Pair of Words Hamming Distance
101, 110 2
111, 000 3
Minimum Hamming Distance No. of Detectable Errors
2 1

Final Answers Summary


- Question 1 (Checksum in Decimal): 6
- Question 2 (Table Provided Above)

You might also like