Scribd
Upload
5 views

ECTA519

Assignment of preschool lesson plan

Uploaded by

samraazhar942
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
5 views

ECTA519

Assignment of preschool lesson plan

Uploaded by

samraazhar942
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/ 4

Assignment Cs601

Bc200406766
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.

Solution:
The data packet contain the following 8-bit segments:-

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

Adding first two segments:

Carry 1 1 1 1 1
bits
Segment 1 1 0 1 1 0 1 1
s1
Segment 1 0 1 0 1 0 1 0
s2
1 1 0 0 0 0 1 0 1
Segments 1 & Segments 2 Adding Answer = 10000101
Carry bit =1
So, if the carry bit is generated then adding carry bit into the
Answer:

Carry bits 1
Answer 1 0 0 0 0 1 0 1
segments
Carry bit 0 0 0 0 0 0 0 1
Answer 1 0 0 0 0 1 1 0
Put the answer in original segments
10000110 11110000 00001111
Adding first two segments

Carry bits
Segment 1 0 0 0 0 1 1 0
s1
Segment 1 1 1 1 0 0 0 0
s2
1 0 1 1 1 0 1 0 0
Segments 1 & Segments 2 adding answer = 01110100
Carry bit = 1
So , if the carry bit is generated then adding carry bit is
generated then adding carry bit into the answer

Carry bit
Answer 0 1 1 1 0 1 0 0
Segment
Carry bit 0 0 0 0 0 0 0 1
Answer 0 1 1 1 0 1 0 1
Put the answer in original segment
01110101 00001111
Adding first two segments

Carry bits 1 1 1 1 1 1 1
Segment 0 1 1 1 0 1 0 1
s1
Segment 0 0 0 0 1 1 1 1
s2
Answer 1 0 0 0 0 1 0 0
Segments answer is = 10000100
Take 1s Complement of segment answer is = 01111011
Tasks :
Provide 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)

(10110, 01011)

(11100, 11110)

(01101, 11101)

Minimum Hamming distance

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