etween. *
A
B
D
3. Which shows the following numbers in order from least to greatest? *
B
C
D
4. Which is the best name for this group of numbers? *
A
B
D
5. Which point on the number line best represents √3? *
A
B
C
For question 6 and 7, write each number in either scientific notation or standard notation. 6. The diameter of Mercury is 4879 kilometers. *
7. The diameter of a bacterial cell called a mycoplasma is about 2 x 10-7 meter. *
8. In which group are the numbers in order from greatest to least? *
B
C
D
9. Greg found the length of a hypotenuse of a right triangle to be √90 feet. Between which two integers does √90 lie? *
A
B
C
10. Which is the best name for this group of numbers? *
A
C
D
11. The water levels of five Texas lakes were measured on the same day in 2010. The table below shows the number of feet above or below normal level for each lake. Which list shows the numbers in the table from greatest to least? *
B
C
D
12. Which numbers from this list are less than -0.94? *
B
C
D
13. The length of a micrometer is approximately 0.00003937 inch. How would you express this in scientific notation? *
A
B
C
14. The National Park Service manages approximately 84,000,000 acres of federal land. How would you express this number using scientific notation? *
B
C
D
15. Seismosaurus is the longest known dinosaur. It measured 1800 inches. How far would 3000 Seismosaurus dinosaurs span if they were placed head to tail? Write your answer in scientific notation. *
You will use a single backing array(instead of two) and two hash functions (both MultiplicativeHashFunction objects), h1 and h2.
The z values for your hash functions (and all subsequent hash functions needed when resizing or rehashing) will be taken from an array of integers passed to the CuckooHashTable constructor. The first value in the array will be used for the first incarnation of h1, the second value for the first incarnation of h2, the next two values will be used for the next incarnations of h1 and h2, etc.
Note: be careful to follow this. We will be checking your array (via toString()) and correctness will depend on using the same values of z as we do when generating the test code. The MultiplicativeHashFunction objects you will use also have a getParams() method to show the value of z,w,d when that hash function is used.
When adding an item, x, that is not in the hash table already, always add it to t[h1(x)] (even if t[h1(x)] is already taken and t[h2(x)] is available).
The load factor must always satisfy α=n/t.length≤1/2. If adding an item will violate this then resize the table (doubling its size) and rehash everything (before doing the add).
After removing an item, if the load factor satisfies α=n/t.length<1/8 AND the dimension satisfies d≥5 then resize by reducing the size of the bucket table by a factor 2 and rehash everything.
Each time you resize you will create two new hash functions using the next two z values (that were initially passed to the constructor).
Your constructor should initialize an empty bucket array of size 16 (i.e., d=4). This is the minimum size your bucket array should ever be. Never let the dimension be smaller then 4.