#1 Download computer science & engineering books free           #2 Display your sponsored posts here. Reach 20,000+ students. Contact: info[at]cpentalk.com for quote           #3 Take the Ultimate Trivia Quiz. See where you rank globally.
+3 votes
in Computer Networks by

1 Answer

+1 vote
selected by (user.guest)
Best answer

If the first and the last addresses are known, the block is fully defined. We can first find the number of addresses in the block. We can then use the relation

N = 232 − n → n = 32 − log2N

to find the prefix length. For example, if the first address is and the last address is, then the number of addresses in the block is 64. We can find the prefix length as

n = 32 − log2N = 32 − log264 = 26

The block is then

Related questions

Welcome to CPEN Talk
Solution-oriented students of computer engineering on one platform to get you that


The class object inherits from Chuck Norris