UDP and TCP use 1s complement for their checksums. Suppose you have the following three 8- bit bytes: 01010101, 01010110, 01100101. a. What is the 1s complement of the sum of these 8-bit bytes? (Note that although UDP and TCP use 16-bit words in computing the checksum, for this problem you are being asked to consider 8-bit sums.) Show all work. b. With the l's complement scheme, how does the receiver detect errors? c. Is it possible that a 1-bit error will go undetected? How about a 2-bit error?

UDP and TCP use 1s complement for their checksums. Suppose you have the following three 8- bit bytes: 01010101, 01010110, 01100101. a. What is the 1s complement of the sum of these 8-bit bytes? (Note that although UDP and TCP use 16-bit words in computing the checksum, for this problem you are being asked to consider 8-bit sums.) Show all work. b. With the l's complement scheme, how does the receiver detect errors? c. Is it possible that a 1-bit error will go undetected? How about a 2-bit error?

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

UDP and TCP use 1's complement for their checksums. Suppose you have the following three 8-bit bytes: 01010101, 01110000, 01001100. What is the 1's complement of the sum of these 8-bit bytes? (Note that although UDP and TCP use I6 bit words in computing the checksum, for this problem you are being asked to consider 8-bit summands). Show all work. Why it is that UDP takes the 1's complement of the sum; that is, why not just use the sum? With the 1's complement scheme, how does the receiver detect errors? Is it possible that a one-bit error will go undetected? How about a two-bit error?
UDP and TCP use one’s complement for the checksum. Suppose you have the flowing four 8-bit data in a datagram: 10011011, 01011100, 11001101. 10101001 a) What is the one’s complement of the sum of the four? Show your work. b) Is it possible that a 1-bit error will go undetected? Is it possible that a 2-bit error will go undetected?
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation
Interpret the following bit stream under the given circumstances 100100010111, i. Assume it represents 3 digits in BCD, what are the 3 digits?
The address field of a Frame Relay frame is 1011000000010111. What is the DLCI in decimal? What is the DLCI in binary? The address field of a Frame Relay frame is 101100000101001. Is this valid? Find the DLCI value if the first 3 bytes received is 7C 74 El in hexadecimal. Find the value of the 2-byte address field in hexadecimal if the DLCI is 178. Assume no congestion. How does Frame Relay differ from X.25? What is SONET and SONET/SDH? What are the various devices that can interconnect to SONET?
1. Suppose you have the following 2 bytes: 01011100 and 01100101. What is the 1s complement of the sum of these 2 bytes? 2. Suppose you have the following 2 bytes: 11011010 and 01100101. What is the 1s complement of the sum of these 2 bytes? 3.. For the bytes in part (a), give an example where one bit is flipped in each of the 2 bytes and yet the 1s complement doesn' t change.
Networking Let us calculate the checksum for a text of 8 characters (“Fundamentals”). The text needs to be divided into 2-byte (16-bit) words. We use ASCII (see Appendix A) to change each byte to a 2-digit hexadecimal number. Find the sum, wrapped sum, and checksum at both the sender side and receiver side. You must show me your work.
A bit-wise operation is defined as below: LDR r0, =0x000000C8 LDR r1, =0x00000038 LSR r2, r0, #2 What is r2 value after the LSR operation is executed ? O Ox00000032 O Ox00000022 O Ox00000012 Ox00000002
Suppose you have the following 2 bytes: 11011010 and 01100101. What is the 1s complement of the sum of these 2 bytes?
Under the Binary Convolutional Codes for a 100-bit codeword how many check bits are needed? What is the code rate in this example?
Asap
The number 12.410 is to be written using the closest 8-bit unsigned binary representation. i.Show, using a table of column weightings, that 1100.01102 represents the decimal value 12.37510. ii.Show, using a table of column weightings, that 1100.01112 represents the decimal value 12.437510. iii.Using your results from (i) and (ii) write down the 8-bit unsigned binary number and its decimal equivalent that gives the best approximation to 12.410. iv.Write the decimal number you wrote down in (iii) as a percentage of 12.4. Write your final answer as a percentage rounded to two decimal places.