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

In a Von Neumann architecture, groups of bits have no intrinsic meanings by themselves. What a bit pattern represents depends entirely on how it is used. The following table shows bit patterns expressed in hexadecimal notation i. 0x000940C2 ii. 0x8C90FFFC Qa)What decimal number does each bit pattern represent if, i.It is a two’s-complement integer? ii.It is an unsigned integer? b) If each bit pattern represents an MIPS instruction, what instruction will be executed? c) What decimal number does each bit pattern represent if it is a floating-point number in IEEE 754 standard?
1 a. If the last operation performed on a computer with an 8-bit word was an addition in which the two operands were 00000010 and 00000011, what would be the value of the following flags? ● Carry • Zero • Overflow Sign • Even Parity ● Half-Carry b. Repeat for the addition of -1 (twos complement) and +1.
Assume that a datasum of OxC1 has been computed for a sequence of bytes. What is the 2's complement checksum? OxFF 0x00 Ox3F OXC1 OxC2 Ox3E
Use the following data declarations. Assume that the offset of byte Val is 00000000: .data byte Val sbyte 1,2,3.-7h word Val word 1000h.2000h 3000h, 4000h dwordVal dword 34567890h, 90785634h, 1234674Sh Show the value of the final destination operand after each of the following code fragments has executed: (If any instructions is invalid, indicate "INV" as the answer and briefly explain why) a. moy di 2 mov al, byte Val[di] b. mov bx, word Val mov esi, offset wordVal+4 xchg bx, [esi] R c. movsx cx, byte Val+3 d. mov ax, word ptr [dwordVal mov bl. byte ptr [dwordVal +10] e. mov al, 80h number add al 40h signed ;signed number answer al-= answer bx= answer (show your answer in binary) CX- answer |esi= answer bl= SF=
If the floating-point number representation on a certain system has a sign bit, a 3-bitexponent and a 4-bit significand: • What is the largest positive and the smallest positive number that can be stored on this?system if the storage is normalized? (Assume no bits are implied, there is no biasing,exponents use two's complement notation, and exponents of all zeros and all ones areallowed.)• What bias should be used in the exponent if we prefer all exponents to be non-negative?Why would you choose this bias? show work and write out solution
Explain the term masking. How is it useful for data representation? Explain the concept using an example For a floating-point format with a k -bit exponent and an n -bit fraction, give a formula for the smallest positive integer that cannot be represented exactly (because it would require an n + 1 –bit fraction to be exact).
For each of the following binary codes, answer all of the following questions with justification: (a) (b) (c) (d) ● ● Is it linear? What is its block length, message length, and rate? What is its distance? How many errors can it detect, and how many can it correct? (To answer this question you should give the largest number of errors that the code can guarantee to detect or correct. For example a simple parity bit can detect 1 or 3 errors but cannot detect 2 errors so we would say this can detect only a single error. No calculations of probability are required.) The code with seven codewords where seven messages are encoded as follows: 0000000 0010011 0100101 0110110 1001001 101 1010 1101100 The code consisting of thirty-two codewords where each codeword consists of a 5-bit message padded with an additional bit to give ODD parity: that is, each codeword contains an odd number of 1s. For example the word 11111 would be padded with a 0 to give 111110, while 00000 would be padded with a 1…
You can determine the maximum and minimum possible values for a datatype based on the number of bits that it uses (I cover this in lecture, note it differs for unsigned compared with signed). The idea is to consider which bits should be 0 or 1 to achieve the maximum and minimum values, respectively. 1. For each type in the table, enter the minimum and maximum Base 10 values you can represent. Minimum (Base 10) Maximum (Base 10) Type unsigned byte byte unsigned int int Note: You can express your answers as powers of 2 if you want.
ki :Given the following stream of bits (01111000), encode these bits of the stream using NRZ-L, NRZ-I, RZ, Manchester and differential Manchester encoding methods
Consider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B If the machine is big endian and uses two’s complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). Make it fast
In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of O's and 1's. The input is the 64 bit block 0000000000000100000000000100001000100000000000000000100000000000 Suppose that the subkey for the current round is this 48 bit number: 000000000000000010000000000000000000000000000000 What does the 64 bit state lok like after the IP transformation is applied to the input? Now find Ln and Ro, the left and right halves of the state. Lo =0 Ro = What is the result of applying the expansion box to Ro? E(Ro) = 0 What is the result of XORing the subkey with E(Ro)? k1 e E(Ro) = We now apply the S-box transformation. S(kı O E(Ro)) = Finally we apply the permutation box to complete the function f. f(Ro) = P(S(kı O E(Ro))) = We can now compute the state of DES going into the next round. L, =|| Rj =
Consider the hex value 0x01494022 as representing one MIPS machine language instruction: Convert the hexadecimal value to 32 bit binary value. What is the operational code value (opcode) for this instruction? What is the name of the instruction with that opcode? What is the format of the instruction (R, I, or J)? Show the MIPS format of the instruction using the appropriate syntax?