Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 27, Problem 27.6PE
Program Plan Intro
Animation of linear probing
Program plan:
- Import the required package.
- Create the class “Ex27_06”.
- 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,
- 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 solutionStudents have asked these similar questions
- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it form the table. Themethod returns true, if the deletion is successful and false otherwise.(vi)…
A. We have decided to change the type of hashing we use to a newer version that is collision resistant. What happens when a hash collision occurs?
You can figure out the plain text from the hash.
When two different plaintexts produce the same hash.
The same plain text produces two different hashes using the same hash function.
A variable-length text produces a fixed-length hash.
B.“Alice” and “Bob” are talking about hashing and they use the abbreviation MAC. What are they talking about?
Message Authentication Code.
Media Access Control.
Mandatory Access Control.
Message Access Code.
C.Which one of the following is not one of the basic requirements for a cryptographic hash function?
The function must be collision free.
The function must work on fixed-length input.
The function must be relatively easy to compute for any input.
The function must be one way.
D.Bob wants to produce a message digest of a 2,048-byte message he plans to send to Alice. If he uses the SHA-1 hashing…
Class HashTable:
Implement a hash table to store integers (including negative ones). stored in the table int[] data.
Use the hash function: h(x) = (x · 701) mod 2000.
The table size is 2000.
Ensure non-negative indices between 0 and 1999.
Implement the following methods:
insert(int key): Inserts the integer into the table. Returns true if successful, false if the element is already in the table.
search(int key): Searches for the integer in the table. Returns true if found, false otherwise.
delete(int key): Deletes the integer from the table. Returns true if successful, false otherwise.
Class HashTable2:
Implement a second hash table using a different hash function and collision resolution strategy.
Keys are integers (including negative ones).
Use the hash function: ℎ(�)=(�⋅53)mod 100h(x)=(x⋅53)mod100.
The table size is 100.
Ensure non-negative indices between 0 and 99.
Implement the following methods:
insert(int key): Inserts the integer into the table. Returns true if…
Chapter 27 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 27.2 - Prob. 27.2.1CPCh. 27.3 - Prob. 27.3.1CPCh. 27.3 - Prob. 27.3.2CPCh. 27.3 - Prob. 27.3.3CPCh. 27.3 - Prob. 27.3.4CPCh. 27.3 - Prob. 27.3.5CPCh. 27.3 - Prob. 27.3.6CPCh. 27.3 - If N is an integer power of the power of 2, is N /...Ch. 27.3 - Prob. 27.3.8CPCh. 27.3 - Prob. 27.3.9CP
Ch. 27.4 - Prob. 27.4.1CPCh. 27.4 - Prob. 27.4.2CPCh. 27.4 - Prob. 27.4.3CPCh. 27.4 - Prob. 27.4.4CPCh. 27.4 - Prob. 27.4.5CPCh. 27.4 - Prob. 27.4.6CPCh. 27.5 - Prob. 27.5.1CPCh. 27.6 - Prob. 27.6.1CPCh. 27.6 - Prob. 27.6.2CPCh. 27.6 - Prob. 27.6.3CPCh. 27.7 - Prob. 27.7.1CPCh. 27.7 - What are the integers resulted from 32 1, 32 2,...Ch. 27.7 - Prob. 27.7.3CPCh. 27.7 - Describe how the put(key, value) method is...Ch. 27.7 - Prob. 27.7.5CPCh. 27.7 - Show the output of the following code:...Ch. 27.7 - If x is a negative int value, will x (N 1) be...Ch. 27.8 - Prob. 27.8.1CPCh. 27.8 - Prob. 27.8.2CPCh. 27.8 - Can lines 100103 in Listing 27.4 be removed?Ch. 27.8 - Prob. 27.8.4CPCh. 27 - Prob. 27.1PECh. 27 - Prob. 27.2PECh. 27 - (Modify MyHashMap with duplicate keys) Modify...Ch. 27 - Prob. 27.6PECh. 27 - Prob. 27.7PECh. 27 - Prob. 27.8PECh. 27 - Prob. 27.10PECh. 27 - Prob. 27.11PECh. 27 - (setToList) Write the following method that...Ch. 27 - (The Date class) Design a class named Date that...Ch. 27 - (The Point class) Design a class named Point that...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Implement a resize function for a hash table. Resizing is the process of increasing a hash table's size when too many items have been added, reducing the hash table's effectiveness. To resize the hash table, increase the size of the table by some small factor (not less than 2x), remove everything from the old table, and insert it into the new larger table. Make sure to free up memory that is no longer used after resizing. Use the following heuristics to resize the table: • When the load factor exceeds .5. If no entry is found within the probe distance. Note, you may need to change insert as well to have a fully working solution.arrow_forwardWrite a function that is passed an array of numbers and returns a hash table containing the minimum, maximum and average value. @{min=????; max-???; average=???} Test by passing the function 3 different arrays of randomly generated numbers. If the array is empty set all 3 values to zero. (3)arrow_forward#9. a program to implement hashcode and equals..arrow_forward
- ,Write a program to implement hashcode and equals.arrow_forward2. a) Why is Hashing preferred over other method of searching? b) Explain the differences between open hashing and closed hashing. What are the advantages and disadvantages for each of them. c) Given the following keys: 55, 64, 37, 100 and 25 Using the hash function, h(k)= int (M * frac(k * A)) Where frac(x) = fractional part of the number x, for example frac(3.567) = 0.567) M is the size of the hash table and is given as 13 A = constant = 0.35784 (given) For accuracy, you must keep as many digits possible in the fraction, don't round it up. Compute the Hash Values using the above function. Is there any collision?arrow_forwardIn this task, two hash tables should should be implemented. You can follow the followinginstructions:- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it…arrow_forward
- All of these statements are related to hash function, hash table.arrow_forward(Sort ArrayList) Write the following method that sorts an ArrayList: public static <E extends Comparable<E>> void sort(ArrayList<E> list) Write a test program that prompts the user to enter 10 integers, invokes this method to sort the numbers, and displays the numbers in increasing order. Sample Run Enter 10 integers: 3 4 12 7 3 4 5 6 4 7 The sorted numbers are 3 3 4 4 4 5 6 7 7 12 Class Name: Exercise19_09arrow_forward= Question 3. In the following hash table, we insert elements using hashing with open addressing with quadratic probing. Elements have as keys integer numbers, and the hash function for the i-th probe is given by hash(x, i) (x + ²) %11. We insert, in the given order, the elements with the following keys: 46, 58, 57, 39. Indicate, where these elements will be placed in the table. index value 0 1 2 3 4 5 6 7 8 9 10arrow_forward
- For this task you will write an application of the following simple hashing algorithm using Python basic operations and list and string methods. The block diagram of the algorithm will be shown in the following image: Read the required String Str = "Your full name" Convert it to ASCII Generate an Integer random M Random 9798798... Print the Hashing Code hx = a9e70af... Store the results into list of numbers AsciiList = [77, 8, 9, .. Find the product of the list values Prod = 9798798... XOR with both numbers num= 8987987... Convert to Hexadecimal Notation hx = a9e70af... Trim the results to 16 Characters onlyarrow_forwardQ6/ A: Write a program that reads three issues and arranges them in a differential order? B: Write Chain-Generating Program: 0,1,1,2,3,5,8,13,21,34,55,89,144,233,.. The user determines the chain length? Q7: A: Proof that the next matrix is vertical: 1 2 2 -1 4 10 -1 B: Write a program that provides the user with the possibility to draw one of the following functions as chosen: Sin, cos, log, exp, tan, 1/x, 1/log(x), 1/x Q8: A: what is data? What is a data network? What is a converged. B: Describe network- supported technologies that impact how people learn „work,and play. Q9: A: Compare and contrast the layers of the OSI model with the TCP/IP protocol stack.arrow_forward3. Implement quadratic probing, double hashing, and linear probing. Compare them with two criteria: 1) number of collisions, 2) average probe length (probe length: how many tries to find an empty slot; average probe length: total probe length divided by total number of items in the hash table. Summarize the comparison into a table or a plotarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education