Given the following Java functions, transcribe it into a Python 3 program. /* Each entry stores a (key, value) pair, it's hash value and * a reference to the next entry with the same hash value */ class Entry { Object key; Object value; final int hash; Entry next; /** * Create new entry. */ Entry(int h, Object k, Object v, Entry n) { value = v; next = n; key = k; hash = h; } }

Given the following Java functions, transcribe it into a Python 3 program. /* Each entry stores a (key, value) pair, it's hash value and * a reference to the next entry with the same hash value */ class Entry { Object key; Object value; final int hash; Entry next; /** * Create new entry. */ Entry(int h, Object k, Object v, Entry n) { value = v; next = n; key = k; hash = h; } }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Given the following Java functions, transcribe it into a Python 3 program. /*** Associates the specified value with the specified key in this hash table.* If the hash table previously contained a mapping for this key, the old* value is replaced.*/public Object put(Object key, Object value) {int hash = hash(key);int i = indexFor(hash, table.length); for (Entry e = table[i]; e != null; e = e.next) {if (e.hash == hash && eq(k, e.key)) {Object oldValue = e.value;e.value = value;return oldValue;}}addEntry(hash, k, value, i);return null;} /*** Add a new entry with the specified key, value and hash code to* the specified bucket. It is the responsibility of this* me…
Given the following Java functions, transcribe it into a Python 3 program. /*** Removes and returns the entry associated with the specified key* in the Hash Table. Returns null if the Hash Table contains no mapping* for this key.*/Entry removeEntryForKey(Object key) {int hash = hash(key);int i = indexFor(hash, table.length);Entry prev = table[i];Entry e = prev; while (e != null) {Entry next = e.next;if (e.hash == hash && eq(k, e.key)) {size--;if (prev == e)table[i] = next;elseprev.next = next;return e;}prev = e;e = next;}return e;}
Given the following Java functions, transcribe it into a Python 3 program. /*** Rehashes the contents of this hash table into a new array with a* larger capacity. This method is called automatically when the* number of keys in this hash table reaches its threshold.*/void resize(int newCapacity) {Entry[ ] oldTable = table;int oldCapacity = oldTable.length;if (oldCapacity == MAXIMUM_CAPACITY) {threshold = Integer.MAX_VALUE;return threshold;} Entry[ ] newTable = new Entry[newCapacity];transfer(newTable);table = newTable;threshold = (int)(newCapacity * loadFactor);}
We wish to build a Hash Table, which is able to deal with collision by using linear and quadratic probing. Please write a public class HashLinQuad as follows: public class HashLinQuad { private int[] table; //hash table private int size; //current number of elements private int capacity //capacity of the hash table private HashLinQuad (int size){ table = new int[size]; } public int addLin (int obj) { … //add obj into table using linear probing } public int addQuad (int obj){ … //add obj into table using quadratic probing } … } 1. Implement the two methods addLin and addQuad that apply linear and quadratic probing, respectively. 2. Test your implemented methods addLin and addQuad . To this end, create the following two objects in class Main : HashLinQuad linHashTable = new HashLinQuad(1249); HashLinQuad quadHashTable = new HashLinQuad(1249); 3. Please insert the same 1000 random integer values (in the same order) into: a. the object `linHashTable` by using the method `addLin` and count…
Given the following Java functions, transcribe it into a Python 3 program. /*** Add a new entry with the specified key, value and hash code to* the specified bucket. It is the responsibility of this* method to resize the table if appropriate.*/void addEntry(int hash, Object key, Object value, int bucketIndex) {table[bucketIndex] = new Entry(hash, key, value, table[bucketIndex]);if (size++ >= threshold)resize(2 * table.length);}
Java program to Draw the hash table that results from adding the f to a hash table using shift folding of the first two digits with the last two digits. Use a table size of 13.
Consider the following hashCode() implementation forString, which was used in early versions of Java:public int hashCode(){ int hash = 0; int skip = Math.max(1, length()/8); for (int i = 0; i < length(); i += skip) hash = (hash * 37) + charAt(i); return hash;}Explain why you think the designers chose this implementation and then why youthink it was abandoned in favor of the one in the previous exercise
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)…
In 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…
Consider the below integer array which is already sorted { 1, 2, 3, 4, 4, 6, 6, 6 } program in Java which removes the duplicates from the array in O(n) time with O(n) space complexity owing to a hash structure. Your output should be [ 1, 2, 3, 4, 6] .
- 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)…
Consider the following hashCode() implementation forString, which was used in early versions of Java:public int hashCode(){ int hash = 0; int skip = Math.max(1, length()/8); for (int i = 0; i < length(); i += skip) hash = (hash * 37) + charAt(i); return hash;}Explain why you think the designers chose this implementation.se