UDP and TCP use 1s compliment for their checksum. Suppose you have the following two 8-bit bytes: 0101, 1010. What is the 1s compliment of the sum of these 8-bit bytes? Suppose the two bytes are altered during transmission with the checksum as follows: 1001, 0110. Can the checksum be used to detect the alteration?
Answer)
Checksum calculation::
Adding the following two 8-bit bytes:
0101 + 1010 = 01111
Since 5 digits then adding the 0 to 1111 gives us = 1111
1's complement of the above value = 0000
checksum is as follows: 1001, 0110
These checksums are detecting errors in each of the 4 bits as first second third and fourth place of the bit.
Thus the answer is:
0000, yes - can detect
To calculate the 1s complement of the sum of two 8-bit bytes, follow these steps:
Step 1: Add the two 8-bit bytes (0101 + 1010) to get the sum. 0101 + 1010 = 1111
Step 2: Take the 1s complement of the sum. 1s complement of 1111 = 0000
The 1s complement of the sum of the two 8-bit bytes (0101 and 1010) is 0000.
Now, let's check if the altered checksum (1001, 0110) can be used to detect the alteration.
Step 1: Add the two altered 8-bit bytes (1001 + 0110) to get the sum. 1001 + 0110 = 1111
Step 2: Take the 1s complement of the sum. 1s complement of 1111 = 0000
The 1s complement of the sum of the altered 8-bit bytes (1001 and 0110) is also 0000.
Since the 1s complement of the sum of the original bytes and the altered bytes are the same (both are 0000), the checksum cannot detect the alteration. This is a case of a "checksum collision," where different sets of data result in the same checksum value, leading to a potential failure in error detection.
UDP and TCP use 1s compliment for their checksum. Suppose you have the following two 8-bit...
UDP and TCP use 1s complement for their checksum. Suppose you have the following two 8-bit bytes: 0101, 1010. What is the 1s complement of the sum of these 8-bit bytes? Suppose the two bytes are altered during transmission with the checksum as follows: 1001, 0110. Can the checksum be used to detect the alteration?
1. a)UDP and TCP use 1’s complement for their checksums. Suppose you have the following three 8 bit bytes: 0101 0011, 0111 0110, 1001 0011. What is the 1’s complement of the sum of these 3 8-bit bytes? Show all work. Why is it that the 1’s complement is used and not just the sum? What is the sum of the three 8 bit bytes and the checksum you just computed? What is it if you change the first 8...
4. UDP and TCP use 1's complement for their checksums. Suppose you have the following two 16-bit words: 0101 0101 0101 0101 and 1010 1010 1010 1011. 4.a. (2 pts.) What is the 1's complement of the sum of these words? Show all work. 4.b. (2 pts.) With the 1's complement scheme, how does the receiver detect errors? 4.c. (2 pts.) Is it possible that a 4-bit error will go undetected? If so, provide an example. 4.d. (2 pts.) Is...
Please answer all Questions Fast and Neatly
UDP Checksum (20 pts) Suppose a gender that is to send a UDP datagram me given below. It is creating the checku. 1110 1101 1111 0110 0100 1010 Checksum 1111 0110 1. Find the binary sum of the other four fields than checksum (8 pts) 2. Wrap around the overflow and add to the least significant bit(s) if any. (2 pts) 3. Find the l's complement of the result of Problem 2. (2...
WHAT IS THE ANWER FOR THE TWO
QUESTIONS
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 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...
I need the following problems worked out (show work). Thee answers are provided, I just need the work explained briefly for each one. 4 - What is the decimal representation of each of the following unsigned binary integers? a. 00110101 (53) b. 10010110 (150) c. 11001100 (204) 6 - What is the sum of each pair of binary numbers? a. 10101111 + 11011011 (110001010) b. 10010111 + 11111111 (110010110) c. 01110101 + 10101100 (100100001) 8 - How many bits are...
Now, suppose you have the following two 8-bit hexadecimal numbers, both of which use two's complement: ef 4a 4. What is the decimal equivalent of each of these numbers? 6. What is their sum in hexadecimal? (Note that the sum must also be confined to 8 bits in order for two's complement to work.)
Suppose you have two 8-bit registers, A and B. A contains the value 11001100 B contains the value 01001111 What is the decimal value of the two's complement binary sum?
In the last module you learned a formula for calculating bit rate, R = b/t, that is the number of bits divided by the time. This formula expresses the number of bits that are transmitted over a circuit in a given period of time. In practice, however, we are not only concerned with the number bits transmitted, but also with the number of data bits transmitted over a circuit. The data bits are those that the sender decides to send...
6. Convert .3710 to a binary fraction of 10 binary digits. 7. Use two's compliment arithmetic to perform the following 8 bit binary operations. a. 0010 1110 + 0001 1011 b. 0101 1101 – 0011 1010 c. 1011 1000 – 1000 1011 d. 1000 1100 – 1111 0111 8. Convert 150.8476562510 to IEEE Floating Point Standard. 9. Simplify the following Boolean expressions. a. xy + xy + xz b. (w + x)(x + y)(w + x + y + z)...