Our description of static hashing assumes that a large contiguous stretch of disk blocks can be allocated to a static hash table. Suppose you can allocate only C contiguous blocks. Suggest how to implement the hash table, if it can be much larger than C blocks. Access to a block should still be efficient.

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

The purpose of this project is to assess your ability to (JAVA): 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 in JAVA. Your hash table should use chaining for collision resolution. You may design any hash function you wish. Your program will read a JAVA 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.

The collision resolution technique that allows for dynamic growth of the hash table is: O a. buckets O b. double hashing O c. linear probing O d. chaining

Show the result when we insert the keys 5; 28; 19; 15; 20; 33; 12; 17; 10 into a hash table with collisions resolved by linked list at each slot. Let the hash table have 9 slots, and let the hash function be h(x) = (2x+1) mod 9. (You are expected to draw the final hash table)

Answer the following ture or false question 1. The 9-entry hash table that results from using the hash function, h(i) = (2i+7) mod 9, to hash the keys 12, 5, 13, 4, 10, 19, 8, 3, and 28, assuming collisions are handled by linear probing as follows: 0 1 2 3 4 5 6 7 8 10 19 3 28 12 8 13 4 5 Group of answer choices True False   2. Here is how the built-in sum function can be combined with Python’s comprehension syntax to compute the sum of all numbers in an n x n data set, represented as a list of lists: sum(sum(subset) for subset in data) Group of answer choices True False 3. Here is the comparison for asymptotic growth rate: (logn) < (n) < (nlogn) < (n^2) < (n^3) < (2^n) Group of answer choices True False   4. Here is the Python’s list comprehension syntax to produce the list of this 26 characters ['a', 'b', 'c', ..., 'z']: [chr(k) for k in range(97, 123)] Group of answer choices True False

3. Consider an example of hash table of size 30, and the following items are to be stored. Design the hash table and the final array in the obtained indexes. (14, 22) (11, 18) (52,71) (41, 20) (30, 29) (33,64)

I am having a hard time finding the right approach for the question. I need a justified answer. Could you please help me through?

Computer science question

2. Write a program by implementing your own PRNG (e.g., using a hash function). You must not use any existing random class or function but implement your own. Produce random bytes (like above). Note the purpose of this part is not to design a strong PRNG that passes randomness tests, but rather for comparison with an existing strong PRNG (above).