Suppose that one byte in a buffer covered by the Internet checksum algorithm needs to be decremented (e.g., a header hop count field). Give an algorithm to compute the revised checksum without rescanning the entire buffer. Your algorithm should consider whether the byte in question is low order or high order.

Suppose that one byte in a buffer covered by the Internet checksum algorithm needs to be decremented (e.g., a header hop count field). Give an algorithm to compute the revised checksum without rescanning the entire buffer. Your algorithm should consider whether the byte in question is low order or high order.

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

Both the utmp file and any directory are organized as a sequence of structs. Consider the two structs definitioned here: struct { char a; int b; char c; } one; struct { char a; char c; int b; } two; Which of the following is true? If you don't know the answer (we did discuss this in class), experiment in order to find the answer. struct one takes up more memory than struct two. struct two takes up more memory than struct one. They both take up the same amout of memory.
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS b. SCAN c. C-SCAN d. LOOK e. C-LOOK
Consider a file system that uses indexed allocation with a maximum of one index node per file. Suppose the index node occupies 4096 bytes, that each block pointer occupies 4 bytes. Ignore the metadata associated with the file that is usually contained in the index node. How large should a block be (in bytes) so that this scheme is able to completely access files on a 1 GB file system?
Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)
Please help me with this problem needed clearly with step by step explanation please...
the input consists of two integers x and y represented as strings of digits. The output is the sum z, also represented as a string of digits. The input can be viewed as a stream if the algorithm is first given the lowest digits of x and of y, then the second lowest, and so on. The algorithm outputs the characters of z as it proceeds. The only memory required is a single bit to store the carry bit. Because of these features, the algorithm can be modeled as a DFA.Write algorithm for Adding( ) pre-cond: The digits of two integers x and y are read in backwards in parallel. post-cond: The digits of their sum will be outputted backwards.
9. Learn to compute a shared K session key in the Diffie-Hellman algorithm if easy-to-calculate initial parameters are given.
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer thread do {…produce next item…wait(empty); wait(mutex);…add the item to buffer…signal(mutex); signal(full);} while (1);//Consumer thread do {wait(full) wait(mutex);…remove next item from buffer…signal(mutex); signal(empty);…consume the item } while (1);
Draw the function ? = 1⁄(1 + ?2) on 2 dimensions X and Z by dividing the -2π to 2π range of x from steps of 0.1 with color blue and dash-dotted line. Imagine that the drawn line of z is a ‘thread’ which if we can copy it multiple times and those copies are kept in parallel to the first one over the direction of a 3rd axis we will generate a surface representing the same curve. a. Use meshgrid function on the x vector and save the result on xx. b. Using size function find the size of xx. c. How does dimensions of xx relate to dimensions of x? d. Using the knowledge of vector multiplication in Octave and using in-built generating functions and size functions, for a given vector v write a single argument function to generate its ‘meshgrid version’ and return it in the variable rep. Avoid using loops! Name your function replicate. (Note: Check if the result is identical to the meshgrid function’s output. Cross check with a small vector) ChatGPT
Consider the following scenario: M A table is sorted on indexed column and has 20,000,000 rows. C . Each row is 300 bytes. Table and index blocks are 4 kilobytes. Assume 1 kilobyte is approximately 1,000 bytes. Assuming the index is sparse, how many entries are in the index? 000,000,000 entries 1 Check hp 2 Try again 4 5
The free space bitmap looks like this: 1010 0000 0000 0000. The system always searches for free blocks starting at the lowest-numbered block. Block size is 4 KiB. (Blocks that belong to the same file do not need to be contiguous.) Write down the bitmap after each of the following actions: (a) File A of size 22 KiB is written. (b) File B of size 10 KiB is written. (c) File A is deleted. (d) File C of size 29 KiB is written. (e) File B is deleted.
Write a program using C++ to implement the three disk-arm scheduling algorithms. Write a driver program that generates a sequence of cylinder numbers (0–999) at random, runs the three algorithms for this sequence and prints out the total distance (number of cylin-ders) the arm needs to traverse in the three algorithms. Please add comments to understand the program .