Show that the Internet checksum will never be OxFFFF (that is, the final value of sum will not be 0x0000) unless every byte in the buffer is 0. (Internet specifications in fact require that a checksum of 0x0000 be transmitted as OxFFFF; the value 0x0000 is then reserved for an omitted checksum. Note that, in ones complement arithmetic, 0x0000 and 0xFFFF are both representations of the number 0.)

Show that the Internet checksum will never be OxFFFF (that is, the final value of sum will not be 0x0000) unless every byte in the buffer is 0. (Internet specifications in fact require that a checksum of 0x0000 be transmitted as OxFFFF; the value 0x0000 is then reserved for an omitted checksum. Note that, in ones complement arithmetic, 0x0000 and 0xFFFF are both representations of the number 0.)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Write an ALP to find the 2's complement of a block of 100 bytes starting at 53000H and store the result in 56000H.
QUESTION 9 What is the hexadecimal representation of the memory variable location at address 003FBA03H in the Little Endian format from the 32-bit binary quantity represented by 10100111 110111100101101100001100b? Address in hexadecimal format 003FBA00H 003FBA01H 003FBA02H 003FBA03H 003FBA04H Data in hexadecimal format O a. The hexadecimal representation for the variable located at memory address 003FBA03 is A8. Ob. The hexadecimal representation for the variable located at memory address 003FBA03 is A5. OC. The hexadecimal representation for the variable located at memory address 003FBA03 is A3. Od. The hexadecimal representation for the variable located at memory address 003FBA03 is A7.
Take into consideration the binary BCH code, which is 127 bits long and has a spacing of 6 bits, and use the binary field extension F128, which is 128 bits in size. How big is the code, and can you ensure a certain minimum space between entries?
Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?
Please written by computer source 7. Suppose you want to complement the right 4 bits of a byte and leave the other 4 bits unchanged. What mask must you use together with what operation?
If we use the 128-bit binary field extension F 128 to decode the 127-bit binary BCH code at a distance of 6, we get a total of 127 bits. How big is the code, and is there a guaranteed minimum separation?
Assume that we have 4 bytes hexadecimal data: 0x2F, 0x3E, 0x1D and 0x4A. Find the checksum byte for this set of data.
As the error-detection and correction capability of a code increases, we would expect in general the overhead bits to protect a group of data bits to decrease remain the same increase
Show that the Internet checksum will never be 0xFFFF (that is, the final value of sum will not be 0x0000) unless every byte in the buffer is 0. (Internet specifications in fact require that a checksum of 0x0000 be transmitted as OxFFFF; the value 0x0000 is then reserved for an omitted checksum. Note that, in ones complement arithmetic, 0x0000 and 0xFFFF are both representations of the number 0.)
Explain why we cannot bit-stuff in character-oriented framing to change a flag byte appearing in the text. Explain why there is only one address field (instead of two) in an HDLC frame. Bit-stuff the following frame payload: 0001111111001111101000111111111110000111
Write a procedure, BitComplement, which will complement each bit in the contents of the ax register. For example, after the following code fragment is executed: mov ax, 0011010111000001B call BitComplement 0011 0101 1100 0001 B then the contents of the ax register will be 1100101000111110B (1100 1010 0011 1110 B).
5. Let the content of register $t1 represent a 2's complement number N. Write a MIPS code fragment such that the register $t2 stores the absolute value of N. In other words, register $t2 has a copy of register $t1 if N is positive, and $t2 should hold the negative of N, if N is negative.