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)