讲解：Data Structures、Algorithms、java、javaR|Python

Data Structures and AlgorithmsIntroductionWe discussed hashing and the use of hash functions for storing data in hash tables. Hashfunctions are also used in cryptography for message authentication. In a simple scenario, Boband Alice send encrypted messages to each other. They want to be able to decrypt messagesthey receive and make sure messages have not been modified during transmission.Cryptographic hash functions must have additional properties that are out of the scope of ourcourse1. In this lab we’ll investigate the property of uniform distribution: the probability foreach element to hash into any of the slots is the same (1/m) for a table of size m. This is adesired property for any hash function.Goal: Testing hash function h(k) = (ak + b) mod m for different choices of theparameters. Implement a rehashing of the hash table.(7 points) You have to write Java code for the following:1. compute the sequence of values h(k) for any sequence of integers given ininput.2. store the sequence computed in (1) in a text file called output_sequence3. plot the pairs (k, h(k)) to see how well/bad elements are distributed. Exportyour plots into PNG files.4. implement a rehashing of the hash table when the load factor α reaches thevalue 0.75.1 See more代写Data Structures作业、代做Algorithms留学生作业、java编程语言作业调试、java实验作业代 in https://en.wikipedia.org/wiki/Pseudorandom_number_generatorAssume your main class is HashPlot. The code will be executed as follows:java HashPlot a b m input_sequenceWhere- h(k) = (ak + b) mod m is the hash function you are testing- input_sequence is a text file with a sequence of numbers divided by blankspaces.Task 1: Identify 3 choices for a, b and m, for which you think the distribution of values is bad(1.5 points).Example of plot for a “not so good” distributionTask 2: Identify 3 different choices for a, b and m, for which you think the distribution ofvalues is good. (1.5 points)Example of plot for a “better” distributionNote: Use sequences of 300-1000 numbers and table size (m) between 90 – 130. In order tocompare different hash functions you may want to look at number of collisions or otherregularities in the distribution of values.SubmissionYou have to submit a zip file named [Net_ID]_Lab8.zip including:a) Your Java code in HashPlot.javab) A README file with a description of your work, the choices for the parameters inTask 1 and Task 2 with your comments about the quality of the distribution,your plots for each case in PNG format.c) The input and output sequences (one text file for each) you used to get the results in(b).转自：http://www.7daixie.com/2019041013143577.html