Data Structure ( comp sci project)
10.36. Describe how to redesign the AbstractHashMap framework to include support for a method, containsKey, as described in Exercise R-10.3. Modify the ChainHashMap class in accordance with your design for the previous exercise.
10.37. Modify the ProbeHashMap class in accordance with Exercise C-10.36.
Redesign the AbstractHashMap framework to include support for a method, containsKey, as described in Exercise R-10.3.
The use of null values in a map is problematic, as there is then no way to differentiate whether a null value returned by the call get(k) represents the legitimate value of an entry (k,null), or designates that key k was not found. The java.util.Map interface includes a boolean method, containsKey(k), that resolves any such ambiguity. Implement such a method for the UnsortedTableMap class.
10 points. Provide two call chains (or stacks) starting with containsKey() for ChainHashMap, one call chain, and for ProbeHashMap, the other call chain. Each method in the call chain should have next to it the class where is implemented. For example:
methodA() (ClassA) -> methodB (ClassB) -> methodC (ClassC)
Top-quality papers guaranteed
100% original papers
We sell only unique pieces of writing completed according to your demands.
We use security encryption to keep your personal data protected.
We can give your money back if something goes wrong with your order.
Enjoy the free features we offer to everyone
Get a free title page formatted according to the specifics of your particular style.
Request us to use APA, MLA, Harvard, Chicago, or any other style for your essay.
Don’t pay extra for a list of references that perfectly fits your academic needs.
24/7 support assistance
Ask us a question anytime you need to—we don’t charge extra for supporting you!
Calculate how much your essay costs
What we are popular for
- English 101
- Business Studies