search
Log In
0 votes
513 views
32: A sender needs to send the four data items Ox3456, OxABCC, Ox02BC, and OxEEEE. Answer the following:

a. Find the checksum at the sender site.

b. Find the checksum at the receiver site if there is no error.
in Computer Networks 513 views
0
data items given in hexadecimal. So, convert it into binary and then add all these binary codes.if there is a carry then add it. finally do the 1's complement of the result after addition and it will be called 16-bit checksum at sender side. append it to the data items and send it to receiver. if at receiver after adding these codes,if answer is zero then there is no error and checksum will be same at receiver.

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
625 views
23: We need a dataword of at least 11 bits. Find the values of k and n in the Hamming code C(n, k) with dmin :3. Soln: We need to find k = 2m −1 − m ≥ 11. We use trial and error to find the right answer: a. Let m = 1 k = 2m −1 − m = 21 −1 − 1 = 0 (not acceptable) b ... = 4 k = 2m −1 − m = 24 −1 − 4 = 11 (acceptable) Comment: The code is C(15, 11) with dmin = 3. How this n=15 came?? please explain
asked Mar 17, 2019 in Computer Networks Nishi Agarwal 625 views
0 votes
0 answers
2
114 views
TCP UDP IGMP ICMP I think ICMP can’t correct the error in data and rest three protocols can correct data errors!
asked Dec 1, 2018 in Computer Networks iarnav 114 views
1 vote
2 answers
3
445 views
If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error. A) 5 B) 4 C) 3 D) none of the above
asked Nov 19, 2018 in Computer Networks iarnav 445 views
2 votes
1 answer
4
230 views
For detecting a single bit error using CRC, it is needed that $x^{i}$ should not be divisible by g(x). So, we make g(x) of at least 2 terms, which renders a single term of e(x) indivisible. But then what is the logic behind keeping MSB as 1. Isn't just keeping ... to make any single bit indivisible? For example, $x^{3}+x^{2}$ is guarantees to detect a single bit error at any position. Is it not?
asked Feb 7, 2019 in Computer Networks superak96 230 views
...