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.8PE
Program Plan Intro
Animation of Quadratic probing
Program plan:
- Import the required package.
- Create the class “Ex27_08”.
- 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 solutionStudents have asked these similar questions
Request:
Can you please help me with answering the following prompt? If you are going to provide me some code, can it please be in the language of either C or C++? Thank you.
Question:
Consider a hash table to size 10. Write a program by using quadratic probing and insert the following keys 27, 6, 9, 32, 82, 12 and 56 into the table. Also write a program to search a number using quadratic probing.
1. (Store numbers in a linked list) Write a program that lets the user enter numbers
and displays numbers as described below. Use a linked list to store the numbers.
Do not store duplicate numbers. Add the methods Sort, Shuffle, and Reverse to
sort, shuffle, and reverse the list in the application class (driver class).
1. (Store numbers in a linked list) Write a program that lets the user enter numbers
and displays numbers as described below. Use a linked list to store the numbers.
Do not store duplicate numbers. Add the methods Sort, Shuffle, and Reverse to
sort, shuffle, and reverse the list in the application class (driver class).
Please submit the source code and bytecode.
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
- (Merge two sorted) Write the following function that merges two sorted lists into a new sorted list:void merge(const int list1[], int size1, const int list2[], int size2,int list3[])Implement the function in a way that takes size1 + size2 comparisons. Write a test program thatprompts the user to enter two sorted lists and display the merged list.Here is a sample run.Note that the first number in the input indicates the number of the elements in the list. This number isnot part of the list. Assume the maximum list size is 80.Enter list1: 5 1 5 16 61 111Enter list2: 4 2 4 5 6The merged list is 1 2 4 5 5 6 16 61 111arrow_forward(Generic binary search) Implement the following method using binary search. public static <E extends Comparable<E>> int binarySearch(E[] list, E key) Note:- Please type this java code fully running and also need an output for this given code.arrow_forward1. Write a get hash() function, which returns the index in the hash table. The hash function is calculated as follows: h(key) is calculated as the remainder after (key +7) is divided by the size of hash table The function header is as follows which has two parameters: key and size of hash table def get hash(key, size):arrow_forward
- (Please Help. My professor did not teach us any of this and will not answer my emails) Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the elements are retreived in a last-in-first-out fashion. In a queue, the elements are retrieved in a first-in-first-out fashion. The class contains: An int[] data field named elements that stores the int values in the queue A data field named size that stores the number of elements in the queue A constructor that creates a Queue object with defult capacity 8 The method enqueue(int v) that adds v into the queue The method empty () that returns true if the queue is empty The method getSize() that returns the size of the queuearrow_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_forward(True/False): Arrays are passed by reference to avoid copying them onto the stackarrow_forward
- Request: Sorry, but can you please help me with the following as I just need help on creating a quadratic probing function? If you are going to provide code, can it please be in either C or C++? Question: Consider a hash table to size 10. Write a program by using quadratic probing and insert the following keys 27, 6, 9, 32, 82, 12 and 56 into the table. Also write a program to search a number using quadratic probing.arrow_forward(Kruskal’s algorithm) The text introduced Prim’s algorithm for finding a minimum spanning tree. Kruskal’s algorithm is another well-known algorithm for finding a minimum spanning tree. The algorithm repeatedly finds a minimumweight edge and adds it to the tree if it does not cause a cycle. The process ends when all vertices are in the tree. Design and implement an algorithm for finding an MST using Kruskal’s algorithm.This is a java code questionarrow_forward) Implement shell sort for a given sequence of increments. Display the outputlist at the end of each pass.arrow_forward
- What is the index of the median-of-3 for the following list. [39, 27, 67, 91, 24, 28, 17, 70, 12, 89, 16, 69] Notes: • Your answer should be a single valid, non-negative, literal Python int value. For example, 123 is a valid int literal. • This question is asking about before any partition operation is carried out. • This is not asking for the median-of-3 value. • You can pre-check your answer (to check it's a valid, non-negative, literal int). Answer: (penalty regime: 10, 20, ... %) Precheck Checkarrow_forwardProblem Description: Write a telephone lookup program. Read a data set of 1,000 names and telephone numbers from a file that contains the numbers in random order. Handle lookups by name and also reverse lookups by phone number. Use a binary search for both lookups.arrow_forwardC++ You will write the code to resize a hash table. Modify the code below. Increase the hash table size from 10 to 50. Write a function to calculate the greatest number of key-value pairs in any bucket in the hash table. Write a function to resize the hash table. Calculate the size of the resized hash table by selecting the next prime number that is greater than or equal to the maximum number of buckets in the original hash table multiplied by 2. (next prime number ≥ (N * 2)). Resize when any list in any bucket contains more than four key-value pairs. Update the control function to randomly generate 200 key-value pairs and add them to the hash table. If any bucket contains more than four key-value pairs, resize the hash table. Print the hash table before it is resized and after it is resized. using namespace std; class HashTable{ private: static int const BUCKET_CNT = 10; list<pair<int, string>> bucket[BUCKET_CNT]; public: bool isEmpty(); int hashFunction(int key); void…arrow_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