Scribd
Upload
24 views3 pages

Assignment CS601 2

Uploaded by

itz amzii
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
24 views3 pages

Assignment CS601 2

Uploaded by

itz amzii
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/ 3

Assignment No.

02 Total Marks: 20
Semester: Spring 2024
CS601: Data Communication Due Date: 24-June-2024
Name =Muhammad Hamza
ID= BC220403820

Solution 2:

Adding First Two Segment:

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 2 Add Ans = 10000101

Carry bit = 1

So add carry bit in answer

Carry bits 1
Ans Segment 1 0 0 0 0 1 0 1
Carry bit 0 0 0 0 0 0 0 1
Answer 1 0 0 0 0 1 1 0

Updated Segment Answer is= 10000110 11110000 00001111

Adding First Two Segment:

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 0 0
Segment 1 and 2 Add Ans is =01110100

Carry Bit = 1

If the carry bit is come then adding carry bit into ans.

Carry Bits
Segment Ans 0 1 1 1 0 1 0 0
Carry bit 0 0 0 0 0 0 0 1
Answer 0 1 1 1 0 1 0 1

Put this ans in orginal segment”

01110101 00001111

Add first two Segment

Carry Bits 1 1 1 1 1 1 1
Segment 1 0 1 1 1 0 1 0 1
Sagment 2 0 0 0 0 1 1 1 1
1 0 0 0 1 1 0 0

Final Segment Answer = 10000100

Let Take One ‘s Complement of Answer = 01111011

8 bits Checksum Answer is = 01111011

Tasks:

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

11011011 10101010 11110000 00001111 01111011


Solution No. 2

Pair of Words Hamming Distance(d)


(11001, 01100) 3
(10110, 01011) 4
(11100, 11110) 1
(01101, 11101) 1
Minimum Hamming distance 1

Best of Luck!

You might also like