Please create a python code that fulfills the following. I really need help. please at least assist if u are unable to answer the whole thing. Really means alot Write a Python script that implements the CHF (the Casual Hash Function.)The input data should be split into blocks of 32 bits. If the last block is smaller than 32 bits, the remaining bits should be filled with 1 followed by as many zeros as required.A and B are 2 buffers with specific values (see below). Each block in the message should be combined as shown in the image below.All resulting blocks (i.e. FB|) should be combined with "&" to produce the digest.The size of the digest is 64 bits.Calculate the digest for the string:"Alright, but apart from the sanitation, the medicine, education, wine, public order, irrigation, roads, the fresh-water system, and public health, what have the Romans ever done for us?"CHF – The Casual Hash FunctionFor each M, where M; is a block in MpaddingM =100...32 bits32 bits32 bits32 bitsA =Ox6745230132 bitsB =Oxefcdab8932 bitsA if i is evenFB =%3DB if i is odd64 bitsDigest = FB, & FB2 & FB3 & ...%3D

Answered: Please create a python code that…

Please create a python code that fulfills the following. I really need help. please at least assist if u are unable to answer the whole thing. Really means alot

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

RCS adopts a reverse delta approach for storing multiple versions of a file. For example, assume a file has three revisions, 1.1, 1.2, and 1.3, RCS stores the file as of version 1.3, then, the differences between 1.2 and 1.3, and the differences between 1.1 and 1.2. When a new version is created, say 1.4, the difference between 1.3 and 1.4 is computed and stored, and the 1.3 version is deleted and replaced by 1.4. Explain why RCS does not simply store the initial version (in this case 1.1) and the differences between each successive version.
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
A common implementation of sequential files on disk has each block point to its successor, which may be any block on the disk. This method requires a constant amount of time to write a block (as the file is originally written), to read the first block in the file, and to read the ith block, once you have read the 1 - 1” block. Reading the lth block therefore requires time proportional to 1. Show how by adding just one additional pointer per node, you can keep all the other properties, but allow the lth block to be read in time proportional to log I. [Hint: heaps have implicit pointers from node I to what other nodes?] Explain what the algorithm for reading the th block has in common with an algorithm for raising a number to the ith power in time proportional to log 1.
Write a C program mexp that multiplies a square matrix by itself a specified number of times. mexp takes a single argument, which is the path to a file containing a square (k × k) matrix M and a non-negative exponent n. It computes Mn and prints the result. Note that the size of the matrix is not known statically. You must use malloc to allocate space for the matrix once you obtain its size from the input file.To compute Mn , it is sufficient to multiply M by itself n −1 times. That is, M3 = M ×M ×M . Naturally, a different strategy is needed for M0 .Input format The first line of the input file contains an integer k. This indicates the size of the matrix M , which has k rows and k columns.The next k lines in the input file contain k integers. These indicate the content of M. Each line corresponds to a row, beginning with the first (top) row.The final line contains an integer n. This indicates the number of times M will be multiplied by itself. n is guaranteed to be non-negative, but…
3. Create a script that creates an n x n matrix A with values 1 on the diagonal and 4 di- rectly above the diagonal, a vector b with n entries (all set to 1), and then time how long BackSubstitution takes with A and b by running tic; x=BackSubstitution (A,b); toc for the following values of n: 2000, 4000, 8000, 16000. Do you see what we expect from looking at the number of operations for back substitution from lecture?
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, what is the location of the next record in the array / data area:
I'm bit confused on how paging allocation in this case. How would we know what the Best, worst, first, next page allocation would be for each of the requests? Assume the bolded USED* is the start for worst, first and next.
Part I Assume that a N × M matrix is stored in a file. However, the file is corrupted somehow, and some numbers replaced with asterisk symbol (*). Write a method that reads given corrupted file and fills the missing data with the average of the column. For example, given matrix 1 2 3 4 6 7 8 10 11 12, missing data should be replaced with 2++11 = 7. Part II Assume that multiple messages are encrypted with Ceaser ciphering' and stored in a file. Write a method that deciphers the messages with given shift value. Note: Use English alphabet with only lower-case characters.
Part I Assume that a N x M matrix is stored in a file. However, the file is corrupted somehow, and some numbers replaced with asterisk symbol (*). Write a method that reads given corrupted file and fills the missing data with the average of the column. For example, given matrix 1 3 4 6 7 8. 10 11 12, missing data should be replaced with 2+8+11 = 7. Part II Assume that multiple messages are encrypted with Ceaser ciphering' and stored in a file. Write a method that deciphers the messages with given shift value. Note: Use English alphabet with only lower-case characters. Part III Assume that multiple arithmetic operations? are stored in a file. However, some of the results are wrong. Write a method that finds the operations which the results are wrong in given file. For example, given operations 1.0 + 2.0 4.0 2.5 + 2.5 5.0 3.0 / 2.0 1.0 %D the method should return 0th and 2nd line strings. Note: Do not round the numbers in any step of the calculation.
The purpose of this project is to assess your ability to: Implement a hash table Utilize a hash table to efficiently locate data Analyze and compare algorithms for efficiency using Big-O notation For this project, you will implement a hash table and use it to store words in a large text file. Your hash table should use chaining for collision resolution. You may design any hash function you wish. Your program will read a file and insert each word into a hash table. Once the table is populated, allow the user to enter words to search for. For each word entered, your program should report the number of elements inspected and whether or not the word was located. Provide an analysis of your insert and search algorithms using Big-O notation. Be sure to provide justification for your claims.
Assume that each block has B = 1000 Bytes, and the buffer pool has m = 1001 frames. What is theexact size of the largest file external memory sorting can sort within 3 passes, i.e., pass 0 to pass 2with pass 2 producing only 1 run?
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