Scribd
Upload
11 views5 pages

Spring 2024 - CS601 - 2 - BC240219108

Uploaded by

hajrashahzadi505
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 views5 pages

Spring 2024 - CS601 - 2 - BC240219108

Uploaded by

hajrashahzadi505
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/ 5

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

Solution file
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:

Adding first two segments;

Carry bits 1 1 1 1 1
Segment 1 1 1 0 1 1 0 1 1
Segment 2 1 0 1 0 1 0 1 0
1 1 0 0 0 0 1 0 1

Segment 1 and Segment 2 Adding Answere = 10000101


Carry bit = 1
So if the carry bit is generated then adding carry bit into Answere:
Carry bits 1
Segment 1 1 0 0 0 0 1 0 1
Segment 2 0 0 0 0 0 0 0 1
1 0 0 0 0 1 1 0

Put the answere in original segment we get:


10000110 11110000 00001111
Again adding first two segments :
Carry bits
Segment 1 1 0 0 0 0 1 1 0
Segment 2 1 1 1 1 0 0 0 0
1 0 1 1 1 0 1 1 0

By adding segment 1 and 2 answere = 01110110


Carry bit = 1
Adding carry bit to answere again

Carry bits
Segment 1 0 1 1 1 0 1 1 0
Segment 2 0 0 0 0 0 0 0 1
0 1 1 1 0 1 1 1

Put the answer in original segment


01110111 00001111

Carry bits 1 1 1 1 1 1 1
Segment 1 0 1 1 1 0 1 1 1
Segment 2 0 0 0 0 1 1 1 1
1 0 0 0 0 1 1 0

.answer of last segment is = 10000110


Take as complement of segment answer is 01111001
So 8-bits checksum = 01111001

Hamming distance:
Pair of Words Hamming Distance(d)
(11001, 01100) 3
(10110, 01011) 4
(11100, 11110) 1
(01101, 11101) 1
Minimum Hamming distance 1

You might also like