Animation of separate chaining Program plan: Import the required package. Create the class “Ex27_07”. In the main() function, Create the buttons to perform insert, delete and search operations. Create the vertical and horizontal box to add the entries. Make the alignment of the pane. Set the title and scene for the animation. For each button raise the event through ActionListener interface. Create the class Hashview that extends the pane, Set the table size to set the hash values. Create a class MyHashMap, Define the constructor MyHashMap() to construct the map with the specified initial capacity and load factor. Define the method clear() to remove the entries from map. Define the method containsKey() to check and return the Boolean value True if the specified key is in the map. Define the method containsValue() to return true if specific value is found. Define the method isEmpty() to return true if the map contains no entries. Define the method put() to add the entry into map. Define the method remove() to remove the entries from map. Define the method rehash() to rehash the map values. Declare the static interface. Declare the method clear() to clear the entries of the map. Declare the method containsKey() and it returns true if the value is present in the amp. Declare the method containsValue() to return true if specific value is found. Define the method get() to return the first value of the map. Define the method put() to put the entries in the map. Define the method size() to return the number of mappings in the map. Define the method Entry() to enter the value of element. Define the method getKey() to return the value. Define the method toString() to represent the string value of key.

Question

Want to see the full answer?

Answer 1

Question

Chapter 27, Problem 27.7PE

Program Plan Intro

Animation of separate chaining

Program plan:

Import the required package.

Create the class “Ex27_07”.

In the main() function,

Create the buttons to perform insert, delete and search operations.

Create the vertical and horizontal box to add the entries.

Make the alignment of the pane.

Set the title and scene for the animation.

For each button raise the event through ActionListener interface.

Create the class Hashview that extends the pane,

Set the table size to set the hash values.

Create a class MyHashMap,

Define the constructor MyHashMap() to construct the map with the specified initial capacity and load factor.

Define the method clear() to remove the entries from map.

Define the method containsKey() to check and return the Boolean value True if the specified key is in the map.

Define the method containsValue() to return true if specific value is found.

Define the method isEmpty() to return true if the map contains no entries.

Define the method put() to add the entry into map.

Define the method remove() to remove the entries from map.

Define the method rehash() to rehash the map values.

Declare the static interface.

Declare the method clear() to clear the entries of the map.

Declare the method containsKey() and it returns true if the value is present in the amp.

Declare the method containsValue() to return true if specific value is found.

Define the method get() to return the first value of the map.

Define the method put() to put the entries in the map.

Define the method size() to return the number of mappings in the map.

Define the method Entry() to enter the value of element.

Define the method getKey() to return the value.

Define the method toString() to represent the string value of key.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

apartmentList is a pointer to the first node in a linked list of nodes. Use this for Parts a, b, and c. Part a. Create an inner class that will hold the following information: the apartment number of the apartment (an int), the number of bedrooms in the apartment (also an int), the current rent of the apartment (a double). Don't forget to include a field for the link! Just create the class itself and the instance variables; you don't need to put any methods into the class.

(Online Address Book revisited) Programming Exercise 5 in Chapter 11 could handle a maximum of only 500 entries. Using linked lists, redo the program to handle as many entries as required. Add the following operations to your program: Add or delete a new entry to the address book. Allow the user to save the data in the address book.

(Plot the cube function) Write a program that draws a diagram for the functionf(x) = x3 (see Figure ).Hint: Add points to a polyline using the following code:Polyline polyline = new Polyline();ObservableList<Double> list = polyline.getPoints();double scaleFactor = 0.0125;for (int x = –100; x <= 100; x++) {list.add(x + 200.0);list.add(scaleFactor * x * x * x);}