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

Write a program that implements the FIFO and LRU page-replacement algorithms presented in this chapter. First, generate a random page reference string to each algorithm, and record the number of page faults incurred by each algorithm. Implement the replacement algorithms so that the number of page frames can vary from 1 to 7. Assume that demand paging is used.
Implement RSA algorithm, without using existing libraries. Your program takes as input a file with the following information, your input file, it will be named input_rsa.txt: a key K (public key if the a=0, and private key if a=1) an input x an integer a of value 0 indicating encryption, and value 1 indicating decryption
The Reflection algorithm can be used to encrypt a C-string (character array terminated with the null character) before it is transmitted over the Internet. The Reflection algorithm works as follows: Each letter in the message is converted to the letter in that is 13 positions to the right of that letter in the English alphabet. If the end of the alphabet is reached, counting continues from the first letter in the alphabet. The case of the letters must be maintained. For example,'M' →'Z', 'x' → 'k', 'A' → 'N'The numeric characters ('0' to '9') are shifted 5 positions to the right of that number in the character set '0' to '9'. If ‘9’ is reached, counting continues from ‘0’. For example,'0' → '5', '2' →'7', '8' → '3' All other characters are left as they are. a) What would the following string be encrypted to by the Reflection algorithm?“Call me at 662-2002 Ext 85393” b) Write a function, getPosition, which finds the position of a letter in the alphabet regardless of the case of the…
Suppose you are given a data file called "f" and a queue called "Q". Each record in "f" has "A" or "D" character. Write an algorithm that reads all the records in the file one by one. If record keeps "A" adds this record to "Q". If record keeps "D" delete an element from the "Q". File "f" and "Q" has the same type. Queue capacity is 20 records.
Store a dictionary of a limited set of words as a hash table. Implement a spell check program that, given an input text file, will check for the spelling using the hash table-based dictionary and in the case of misspelled words will correct the same.
In this exercise you will design and implement a simple encryption program that can either encrypt or decrypt a string of text by following the steps below. Create a dictionary dict that maps each (lower case) character of the basic Latin alphabet to another. Make sure no one letter is mapped to itself. Do not use a simple ordering, such as reversing the alphabet. This will act as your cipher. Your program should be able to ask user for a text and encrypt it. Your program will take each character in the string and swap it with the corresponding character from the cipher, print the encrypted text. Your program should be able to decrypt encrypted text as well. It should perform the opposite operation as the encrypt does. Print the decrypted text. Create a loop that asks if the user would like to encrypt some text, decrypt some cipher text, or exit the program. Perform the operation the user selects, printing the computed text if applicable.
A bit shift is a procedure whereby the bits in a bit string are moved to the left or to the right. For example, we can shift the bits in the string 1011 two places to the left to produce the string 1110. Note that the leftmost two bits are wrapped around to the right side of the string in this operation. Define two scripts, shiftLeft.py and shiftRight.py, that expect a bit string as an input. • The script shiftLeft shifts the bits in its input one place to the left, wrapping the leftmost bit to the rightmost position. • The script shiftRight performs the inverse operation. • Each script prints the resulting string. An example of shiftLeft.py input and output is shown below: Enter a string of bits: Hello world! ello world!H An example of shiftRight,py input and output is shown below: Enter a string of bits: Hello world! !Hello world
Consider the adjacency matrix below. Upload a picture (it can be hand drawn) of the adjacency list of the graph. Note: File size must not exceed 1 MB. * A B C D E A 0 1 0 1 0 0 1 0 0 1 1 0 0 0 0 B с D E 00 1 0 1 0 1 0 0 0 1 1
Write a python program that scans in a large number of tweets from a file, and prints the top 5 hashtags. Approach Parse each word in the file Find a way to isolate the hashtags from the rest of the tweet Compute the frequency of each unique hashtag. Find the top 5 hashtags. Caveats 1. Because this is public dataset, there are many tweets that use special characters that may cause issues during reading in your file. To avoid this, explicitly specify the encoding mode in open when reading in the file. with open('twitter_data.txt', 'r', encoding='utf8') as f: 2. When parsing hashtags be sure to change everything to lowercase. There are cases in the file where two hashtags are the same but differ in case. 3. There is no standard way of sorting a dictionary based on the values. Python gives you access to a sorted function where you can pass in a collection and also specify a comparator which outlines how you want to sort the values. This can be done with a one line lambda function.
Decrypt a message that was encrypted using the following logic: • First the words in the sentence are reversed. For example, "welcome to hackerrank" becomes "hackerrank to welcome" • For each word, adjacent repeated letters are compressed in the format <character><frequency>. For example, "mississippi" becomes "mis2is2ip2i" or "baaa" becomes "ba3". Note the format is not applied for characters with frequency 1. Also, the frequency will be no greater than 9 Return the decrypted string Exampl e..2.ample
Implement a C program to sort a set of 4-byte float point values in ascending order using radixsort. The values are saved in a file. After sorting, the original file should still save the sorted values. Your program must access the file using memory mapping.
Write a program that simulates a paging system using the aging algorithm. The number of page frames is a parameter. The sequence of page references should be read from a file. For a given input file, plot the number of page faults per 1000 memory references as a function of the number of page frames available. Code Solution: https://github.com/preethikandhalu/C/blob/master/aging.c Task to be done based on the above program: Describe what the code does, explaining how it accomplishes its task of implementing the aging page replacement algorithm. You must create an input file for simulating a sequence of page references. Run the program. (Fix any bugs that it may contain, first). Vary the number of page frames, keeping the sequence of page references constant. What can you infer from the results? Plot the output in an Excel graph. Explain your findings. Adjust your inputs to get meaningful outputs.