Scribd
Upload
17 views2 pages

Fall 2024 - CS601 - 2

Uploaded by

mmohsinali087
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
17 views2 pages

Fall 2024 - CS601 - 2

Uploaded by

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

Assignment No.

02 Total Marks: 20
Semester: Fall 2024
CS601: Data Communication Due Date: January 02, 2025

Instructions:
Please read the following instructions carefully before submitting the assignment:
You need to use MS Word document to prepare and submit the assignment on VU-LMS.
It should be clear that your assignment will not get any credit if:

 The assignment is submitted after the due date.


 The assignment is not in the required format (doc or docx).
 The submitted assignment does not open or file is corrupt.
 Assignment is copied (partial or full) from any source (websites, forums, students, etc.).

Objective:

To enhance the learning capabilities of the students about:

 Hamming Distance
 Parity Check
Question No. 1

Find Hamming Distance among each pair of words as given in the following table and fill the “Hamming
Distance” column:

Serial No. Pair of Words Hamming Distance (d)


A (10001, 11110)
B (11100, 11011)
C (10101, 11010)
D (01101, 10111)

Note: No need to provide the calculation steps.

Question No. 2

To ensure reliable exchange of messages, a sender and receiver have agreed to use the “Even Parity Check.” The
sender will append a parity bit to each message, which can then be verified by the receiver. Considering the data
bits of each message given in the following table, calculate the parity bit for each message and write it in the
Parity Bit column:

Message # Data Bits in Message Parity Bit


1 1 0 1 1 1 1 1 1
2 1 1 1 0 1 0 0 1
3 1 1 1 1 0 0 0 0
4 1 0 0 1 0 0 1 0
5 1 1 0 0 0 0 1 1

Best Of Luck!

You might also like