computer sciencedont post copied answer posting mutliple timesmultiple dislikes for sure Consider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose theoriginal datagram has the identification number 227. How many fragments are generated? For eachfragment, what is its size, what is the value of its identification number, fragment offset, andfragment flag?

Find:- fragments =? fragment size=? idetification no.=? fragment offset=? fragment flag=?

Answered: i Consider sending a 2000-byte datagram…

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

Consider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original datagram has the identification number 227. How many fragments are generated? For each fragment, what is its size, what is the value of its identification number, fragment offset, and fragment flag?
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Outline the benefit of the bitmap technique over free lists in searching for free space and in updating free space information.
In the variable-length record representation, a null bitmap is used to indicateif an attribute has the null value. In some applications, tuples have a very large number of attributes, most of which are null. Can you modify the record representation such that the only overhead for a null attribute is the single bit in the null bitmap?
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Describe how to keep the bitmap up to date on record insertions and deletions.
padding Question 11 Suppose we have a block cipher with block size 8-bytes (64-bits) and we will use the padding scheme described in class and used in the homework (PKCS #7, RFC 5652). How many bytes (octets) are added to a message consisting of 11 bytes when applying the padding scheme in PKCS7? Note: The message is written in hexadecimal. Each pair of digits (number or letter) is ONE byte (octet). You answer must be a number (for example, 3, 5, 9, etc.).
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files.a. Outline two benefits and one drawback to using two bits for a block,instead of one byte as described earlier in this chapter.b. Describe how to keep the bitmap up to date on record insertions anddeletions.c. Outline the benefit of the bitmap technique over free lists in searchingfor free space and in updating free space information.
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectively
The CSM Tech organization has a substantial web presence with several publicly accessible web and application servers. You have DNS servers that handle Internet queries for all your publicly accessible resources. However, after doing some statistical analysis on your public DNS servers, you find that your servers are handling recursive lookups for clients that are not within your organization. Your public DNS servers should handle recursive queries only for your internal clients, but the servers should handle iterative (nonrecursive) queries from external sources. What do you recommend? What are the commands needed to implement the solution?
The key to cracking a substitution cipher was first discovered by Arab scholars in the ninth century, but it was not widely known in the West until the fifteenth century. Once frequency analysis of ciphers became widespread, the plain substitution cipher became useless. To fix the problems in the substitution cipher, Blaise de Vigenère invented the strategy of using multiple letter mappings. Rather than using one key for the whole message, Vigenère’s idea was to use a different key for each letter of the message. Using a different key for each letter makes the frequency analysis much more difficult. The key to the Vigenère cipher is the Vigenère square. The rows shown here are simple rotations of the alphabet. Each row in the table shifts the letters of the alphabet one place to the left. When a letter shifts out of the first . The idea is to have the message we want to encode: secretmessage Alongside a word we will use to encrypt: encryptencrypt Plaint text s e c r…
Consider finding a prefix code for a file that consists of the letters a, b, c, d, and e. Suppose that these letters appear in the file with the following frequencies. f(a) = 20; f(b) = 7; f(c) = 10; f(d) = 4 and f(e) = 18: Suppose each character was represented by four binary digits before compression. What is the total number of bits utilized by the data before compression? Apply the Huffman Encoding technique to compress the data and find the total number of bit required to represent the complete file after compression. What is percentage of space saved by the compression technique?
Consider the bitmap form of the free-space map, in which two bits are kept in the bitmap for each block in the file. If the block is between 0 and 30% filled, the bits are 00, between 30% and 60% full, 01, between 60% and 90% full, and over 90% full, the bits are 11. Even for very big data, such bitmaps may be retained in memory. Explain how to maintain the bitmap updated with record insertions and deletions.
A null bitmap is used to indicate whether an attribute has a null value in the variable-length record format. Tuples may contain a lot of properties in certain applications, with the majority of them being null. Is it possible to change the record representation such that the null bitmap's single bit is the sole cost for a null attribute?

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS

i Consider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original datagram has the identification number 227. How many fragments are generated? For each fragment, what is its size, what is the value of its identification number, fragment offset, and fragment flag?