Interactive end-of-chapter exercises


Computing an Internet checksum

Consider the two 16-bit words (shown in binary) below. Recall that to compute the Internet checksum of a set of 16-bit words, we compute the one's complement sum [1] of the two words. That is, we add the two numbers together, making sure that any carry into the 17th bit of this initial sum is added back into the 1's place of the resulting sum); we then take the one's complement of the result. Compute the Internet checksum value for these two 16-bit words:


   10000101   01100000      this binary number is 34144 decimal (base 10)

   01101111   00011011      this binary number is 28443 decimal (base 10)



Question List


1. What is the sum of these two 16 bit numbers? Don't put any spaces in your answer

2. Using the sum from question 1, what is the checksum? Don't put any spaces in your answer




Solution


1. The sum of 10000101 01100000 and 01101111 00011011 = 11110100   01111011

2. The internet checksum is the one's complement of the sum: 11110100   01111011 = 00001011   10000100



That's incorrect

That's correct

The answer was: 11110100   01111011

Question 1 of 2

The answer was: 00001011   10000100

Question 2 of 2

Try Another Problem

We’d appreciate your leave us feedback on this networking tutor.

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site. The networking tutor was designed and implemented by Hashim Zia and Shayan Ahmad from New York University Abu Dhabi.

Copyright © 2010-2025 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu