Scribd
Upload
3 views2 pages

Usman (CS601)

The document contains solutions for an assignment in Data Communication, detailing the steps for binary addition and checksum calculation resulting in a final checksum of 2. It also includes a table showing pairs of binary words and their Hamming distances, indicating the minimum Hamming distance for detectable errors. The assignment is for the Spring 2025 semester and is submitted by Usman Zahid with VU ID BC240426260.

Uploaded by

cacalo3764
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
3 views2 pages

Usman (CS601)

The document contains solutions for an assignment in Data Communication, detailing the steps for binary addition and checksum calculation resulting in a final checksum of 2. It also includes a table showing pairs of binary words and their Hamming distances, indicating the minimum Hamming distance for detectable errors. The assignment is for the Spring 2025 semester and is submitted by Usman Zahid with VU ID BC240426260.

Uploaded by

cacalo3764
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

Name: Usman Zahid

VU ID: BC240426260
Subject: CS601 – Data Communication
Assignment No.: 02
Semester: Spring 2025
Question # 01 Solution
Step 1: First Addition
Group 1 + Group 2

Group 1 Group 2 Result 1

0011 1100 1111

Step 2: Add Result 1 to Group 3


Result 1 Group 3 Result 2

1111 1000 10011 (5 bits)

Overflow = 1
Last 4 Bits = 0011
Add carry: 0011 + 0001 = 0100
Step 3: Add Result 2 to Group 4
Result 2 Group 4 Result 3

0100 0100 1000

(No overflow, continue with this)

Step 4: Final Addition with Group 5


Result 3 Group 5 Result 4

1000 1001 10001 (5


bits)

Overflow = 1
Last 4 Bits = 0001
Add carry: 0001 + 0001 = 0010
Final Result:
Checksum (Binary): 0010
Checksum (Decimal): 2

Question # 02 Solution
Pair of Words Hamming Distance

101, 110 2

111, 000 3

Minimum Hamming Distance Detectable Errors

2 1

You might also like