n this assignment you will implement three types of hash tables. Download the attached Main.java and SymbolTable.java les. The first file defines some tests for the symbol tables, the second is the symbol table interface.

• Write a class called TwoProbeChainHT that implements a two-probe separate chaining hashtable. Two-probe hashing means that you will hash to two positions, and insert the key in the shorter of the two chains.

Proper hash calculations.

∗ For the rst hash function, use the one given in the slides: hash(k)=(k.hashCode() & 0x7 f) %M

∗ For the second hash function, use: hash2(k)= (((k.hashCode() & 0x7 f) % M) * 31) % M

∗ Use Java’s LinkedList class to store each chain.

1

Figure 1: Sample Hashtable Implementation UML

∗ Do not use parallel arrays.

void put(Key key, Value val) – see interface. [8 points]Value get(Key key) – see interface.

void delete(Key key) – see interface.

• Write a class called LinearProbingHT that implements a linear probe hashtable.

Proper hash calculations. [4 points]

∗ Use the basic hash function given in the slides: hash(k)=(k.hashCode() & 0x7 f) % M, each time there is a collision, increase the hash by 1.

· An alternative way to structure this hash function is: hash(k, i) = ((k.hashCode() & 0x7 f) + i) % M, where k is the key and i is the number of collisions.

∗ An example hash sequence might look like: 43587, 43588, 43589, 43590, 43581…∗ Do not use parallel arrays.

LinearProbingHT() – a constructor that defaults to an array of size 997.

void put(Key key, Value val) – see interface.

Value get(Key key) – see interface.

void delete(Key key) – see interface. Do not degrade performance by using tags or extra nulls; you must update the probe sequence containing the element being deleted.

boolean contains(Key key) –

boolean isEmpty() –

int size() –

Iterable<Key> keys() –

There is no requirement to support array resizing.

2

• Write a class called QuadProbingHT that implements a linear probe hashtable. [8 points]Inherit all the functionality but the hash function from LinearProbingHT.

Use the following hash function: hash(k, i) = ((k.hashCode() & 0x7 f) + i*i) % M, where k is the key and i is the number of collisions.

An example hash sequence might look like: 43587, 43588, 43591, 43596, 43603…

• All three classes must implement the SymbolTable interface.

• Do not import any packages other than Queue or LinkedList in your hashtable implementations.

Please find main.java below

java.util.Arrays; java.util.HashSet; java.util.Set;/** * Symbol table testing ground. * * (your name), Acuna * (version) */ { args the command line arguments*/ {System.out.println();testIntegers( TwoProbeChainHT<Integer, Integer>());testStrings( TwoProbeChainHT<String, Integer>());System.out.println();testIntegers( LinearProbingHT<Integer, Integer>());testStrings( LinearProbingHT<String, Integer>());System.out.println();testIntegers( QuadProbingHT<Integer, Integer>());testStrings( QuadProbingHT<String, Integer>());} st An object implementing a symbol table.*/ {System.out.println();System.out.println();Set<Integer> keys = HashSet<>(Arrays.asList(-, -, -, -, -, , , , , , ));st.put(-, );st.put(-, );st.put(-, );st.put(-, );st.put(-, );st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );: ;: ;(st.contains(-)) : ;: ;: ;(!st.contains(-)) : ;: ;(!st.contains()) : ;Set<Integer> stKeys = HashSet<>();(Integer i : st.keys())stKeys.add(i);: ;System.out.println(); size = st.size();st.put(, );: ;: ;: ;size = st.size();st.put(-, );: ;: ;: ;System.out.println();size = st.size();Integer ret = st.get();: ;: ;size = st.size();ret = st.get();: ;: ;System.out.println();size = st.size();st.delete();: ;: ;size = st.size();st.delete();: ;: ;System.out.println();} st An object implementing a symbol table.*/ {System.out.println();System.out.println();Set<String> keys = HashSet<>(Arrays.asList(, , , , , , , , , ));st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );st.put(, );: ;: ;(st.contains()) : ;: ;: ;(!st.contains()) : ;: ;(!st.contains()) : ;Set<String> stKeys = HashSet<>();(String i : st.keys())stKeys.add(i);: ;System.out.println(); size = st.size();st.put(, );: ;: ;: ;size = st.size();st.put(, );: ;: ;: ;System.out.println();size = st.size();Integer ret = st.get();: ;: ;size = st.size();ret = st.get();: ;: ;System.out.println();size = st.size();st.delete();: ;: ;size = st.size();st.delete();: ;: ;System.out.println();}

}below is the symbolTable.java

/** * Symbol table interface. * * Sedgewick and Wayne, Acuna * <Key> search key * <Value> return type */ <, > { ;; ; ; ; ;;}

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

Jaster Jets has $9 billion in total assets. Its balance sheet shows $1 billion in current liabilities, $3 billion in long-term debt, and $5 billion in common equity. It has 700 million shares of common stock outstanding, and its stock price is $30 per share. What is Jaster’s market/book ratio?

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

Jason has just signed a health insurance plan which requires him to pay $210 per month for 5 months. The first payment is due in one month and the interest rate is 12% per annum. What would be the present value of the payments?

$1,735.14dd

$1,398.21

$1,224.63d

$1,019.22

how to calculate that? thank you very much

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

Hello…I need help with my calculus problem. see attachment for details.

2. Jason and Mary Kate are having a bike race to see who can bilre the furthest in a set amount oftime. Let fit] and fit} give the velocity of Jason and Mary Kate respectively, in miles per hour, thours after the start of the race. Assume the race lasts for 1.5 hours. A table with some vaiues offit] and a formula for 9:3} are given below. Assume that fit} is increasing for [l -: t -=: {1.5 anddecreasing for [LB «1’. t a: 1.5, and notice that git] is increasing for [I «c: t a: 1.5. mammal-mm IIiI-Iifi-mlm gm = ritet (a) Write a left—hand Riemann sum with as many snbintervals as pomible for the distance traveledby Jason over the course of the race, and evaluate this Riemann sum. (The snhintervals in theRiemann sum do not have to have the same length.) Eb} Write a Riemann sum with as many snbintervals as possible that gives an UNDERESTIMATE forthe distance traveled by Jason over the course of the race, and evaluate this Riemann sum.Sketch a graph that illustrate. why your Riemann sum is an underestimate. (The snbintervalsin the Riemann sum do not have to have the same length.) (c) Write a Riemann sum with E: subintervals of the same length that gives an UNDEREETIMATE for the distance traveled by Mary Kate over the course of the race, and evaluate this Riemannsum. Sketch a graph that illustrates why your Riemann sum is an underestimate. Ed} Write a right—hand Riemann sum with 5 suhintervals of the same length that gives the distance traveled by Mary Kate over the course of the race, and evaluate this Riemann sum. Sketch agraph that illustrates your Riemann sum. (e) Is it possible to tell solely from the estimated distances in the previous parts who traveledfurther? If so, determine who If not, explain why not. {f} Suppose Mary Kate wants to use a Riemann sum to calculate how far she traveled fori] &lt;’.’. t a: 1.5, accurate to within {1.1 miles. How many times would she have to measure hervelocity in order to achieve this accuracy?

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

JASIMLSNWWSLSW ALE WE WEKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK SDNEUIDEE REL;EREKRE=RRRRLDR=YKDRPTKRT ROTI6O7[7POK.PT.TU TTT UTUO ,PTOUM [TU9999999999999999999999999-=T T ]KT-0Y- 0MY [Y0 KYO GPIHLHGHGYHYKYOGH T OF TP PFGG FT ORPT TOPV TP TO RVRT O,P T,PF,GO PR [VPV,Y, V OYT VBVB PT VB,[,V B,TOV[ CO BYGVB,Y[VB P, ,BF ,HGOY BPNVO HGPOOYGFGCP OIG ODFRD RI EPR E,OPTROTRI TRI R8T UR9 UT0R9 TU R 8R -8T U T T UT 8UT M8 TU MT TT T YGH FDHR F0D R

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"