Scribd
Upload
11 views

Spring 2024 - CS601 - 2

fadfdfadfadsfdsfdsf

Uploaded by

KNOWLEDGE HUB
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
11 views

Spring 2024 - CS601 - 2

fadfdfadfadsfdsfdsf

Uploaded by

KNOWLEDGE HUB
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: Spring 2024
CS601: Data Communication Due Date: 24-June-2024

Instructions:
Please read the following instructions carefully before submitting 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 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:

 Checksum
 Hamming Distance
 Minimum Hamming Distance
Question No.1

Suppose two devices need to communicate with each other in such a way that the data sent by the sender could be
verified at the receiver side for accuracy. For this purpose, both the sender and the receiver agreed upon the use of
Checksum algorithm at both sides.

The data packet contains the following 8-bit segments:

Tasks:

1. Calculate the 8-bit checksum for the given data packet at the sender side only.
2. Provide the complete message with the checksum for transmission by the sender.

Question No. 2

Find the hamming distance for the given pair of words. Also find out the minimum Hamming distance from the
given set of words.
Pair of Words Hamming Distance(d)
(11001, 01100)
(10110, 01011)
(11100, 11110)
(01101, 11101)
Minimum Hamming distance

Best of Luck!

You might also like