Scribd
Upload
13 views

cs601 a2

Uploaded by

alishahmeer056
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
13 views

cs601 a2

Uploaded by

alishahmeer056
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

M.

SHAHMIR KHAN
BC230215178
CS601
ASSIGNMENT 2

Question No. 1

Calculate the bit 8-bit checksum for the given data packet at the sender side only.

Adding first two segments.

11011011

+10101010

110000101

Carry bit = 1

So, if the carry bit is generated then adding carry bit into the answer

10000101

+ 1

10000110

Put the answer in original segments:

10000110 11110000 00001111

Adding first two segments:

10000110

+ 11110000

101110100

Carry bit = 1

Answer is 01110101

So, if the carry bit is generated then adding carry bit into the answer

01110100

+ 1

01110101
Put the answer in original segments:

01110101 00001111

Adding the above two segments:

01110101

+ 00001111

10000100

Segment answer is 10000100

Take 1st complement of segment answer is 01111011

So, 6 bit check sum = 01111011

The complete message with the checksum for transmission by the sender.

11011011 10101010 11110000 00001111 01111011

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) 3

(10110, 01011) 4

(11100, 11110) 1

(01101, 11101) 1

Minimum Hamming distance 1

You might also like