In each example, when would you use a hash and when would you use an array? Counting the number of occurrences of an IP address in a log file. Generating a list of users who are over disk quota for use in a report.

Advances in computing technology which allow for a faster hash rate will provide faster transactions per second.   True ◻ False ◻

You are employed by the NSA (National Security Agency) and you have received the following   message that contains the following text:   “George Smiley arrived in Prague on Friday evening at 10:50 PM. ……”          See TTS.txt   A quick analysis of text can be achieved by storing each word  in a hash table.  After storing all words in a hash table you will then be able to print all the words stored in each row of the hash table. Requirements:     Create a hash key value (int Key) and init to a prime value (13)     Create an array of string pointers S_ptr[13]     Each string pointer, S_ptr[i], should allocate on the heap an array of strings (size 35)     Initialize all row elements of hash table with ‘#’     Read the text, one word a time, and compute its hash index value (int Hash(string Word)     The Hash function should take the numerical sum of all the characters in the Word and calculate (Sum%Key )which is then output to the program as an Index.  Recognize that output Index can…

What exactly does it mean when something is deleted using the delete operator?

Use Python to program a hash with a couple of people and their interconnected birth years. Next, show the people's names and their birth years, and have the user enter one. Reverse the hash and show the birth years, having the user choose a birth year. Then, show the person's name for that birth year. Also, the user should have the option to add and delete entries.

Using linear hashing to insert the given values in the order provided with the hash function hi(K) = K mod 2i . Display how the file grows and the hash functions changes as the records are inserted. Draw the diagrams showing the loading of the data into buckets, overflows, and splits. Also, calculate the average number of block accesses for a random retrieval on the given records.   Given records are 2369, 3760, 4692, 4871, 5659, 1821, 1074, 7115, 1620, 2428, 3943, 4750, 6975, 4981 and 9208.

Unix systems use a hash algorithm to hide passwords. One weakness to this system is the brute force or dictionary attack. To make the system stronger, a added to the entered password before hashing. A/ is

What are some of the reasons that a hash file organisation could have bucket overflow? What kinds of steps can be taken to lessen the frequency with which buckets become full?