I. TRUE OR FALSE. Write the word TRUE if the statement is true or FALSE if the statement is false. Write your answers on the space provided at the end of each numbers. 5. Heapify is the procedure for maintaining the heap property when one of the elements of the heap is changed. . 6. A hash function can result in a many-to-one mapping (causing collision). 7. Collisions can be avoided or prevented by using a "good" hash function. 8. When the key is a string, it must be converted to an integer. One of these string conversions is option #1. The probiem with this technique is that anagrams will map to the same index. 9. Radix is a hash function that converts the base-10 integer key into a binary value. 10. Linear probing is the best collision resolution technique. One of the reasons is that clustering of data can be prevented..

I. TRUE OR FALSE. Write the word TRUE if the statement is true or FALSE if the statement is false. Write your answers on the space provided at the end of each numbers. 5. Heapify is the procedure for maintaining the heap property when one of the elements of the heap is changed. . 6. A hash function can result in a many-to-one mapping (causing collision). 7. Collisions can be avoided or prevented by using a "good" hash function. 8. When the key is a string, it must be converted to an integer. One of these string conversions is option #1. The probiem with this technique is that anagrams will map to the same index. 9. Radix is a hash function that converts the base-10 integer key into a binary value. 10. Linear probing is the best collision resolution technique. One of the reasons is that clustering of data can be prevented..

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

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)…
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…
Must attach output screenshot, editable output In java Implement a generic min heap class and write a test code to test the program. Use hashmap for the update method. You can also use it for the getIndex method. public int getIndex(AnyType x) {//average case O(1) //returns the index of the item in the heap//or -1 if it isn't in the heap //return -1; }public boolean update(AnyType x) {//O(lg n) average case//or O(lg n) worst case if getIndex() is guarenteed O(1) We want an update() operation which increases (or decreases) the priority of the item. The item (or an equal item) will be provided and it should update the priority queue appropriately. The only way to do this efficiently is to use a map to map heap items to indexes so that you know where to start the update (in average case O(1) time). Without this, update() would be O(n) and not O(lg n). Therefore before you implement updating, you need to integrate a map into the code. Whenever an item is placed, moved, or removed…
Write a hash table in which both the keys and the values are of type String. (NOT generic programming OR a generic class.) Write an implementation of hash tables from scratch. Define the following methods: get(key), put(key,value), remove(key), containsKey(key), and size(). Remember that every object, obj, has a method obj.hashCode() that can be used for computing a hash code for the object, so at least you don't have to define your own hash function. **//Do not use any of Java's built-in generic types; create your own linked lists using nodes as covered in section 9.2.2 of Eck, D. J. (2019). Introduction to programming using Java, version 8.1. Hobart and William Smith Colleges. http://math.hws.edu/javanotes However, you do not have to worry about increasing the size of the table when it becomes too full.You should also write a short program to test your solution.
Create a data type that allows you to insert, delete the maximum, and delete the minimum (all in logarithmic time), as well as find the maximum and find the minimum (both in constant time). Tip: Use two heaps.
write a simple hashing function that uses addition and multiplication and then find a pair of strings that will return the same hash value for different strings (i.e you will cause a Hash Collision). The algorithm uses multiplication based on the position of a letter in the hash to avoid a hash collision when two letters are transposed like in 'ABCDE' and 'ABDCE'. Your strings need to be at least three characters long and no more than 10 characters long. Here is the code that computes your hash: while True: txt = input("Enter a string: ") if len(txt) < 1 : break hv = 0 pos = 0 for let in txt: pos = ( pos % 2 ) + 1 hv = (hv + (pos * ord(let))) % 1000000 print(let, pos, ord(let), hv) print(hv, txt) For simplicity we will only use upper and lower case ASCII letters in our text strings. Enter a string: ABCDE A 1 65 65 B 2 66 197 C 1 67 264 D 2 68 400 E 1 69 469 469 ABCDE Enter a string: BACDE B 1 66 66 A 2 65 196 C 1 67 263 D 2 68 399 E 1 69 468 468 BACDE
3) L is a data element linear list. Implement the list as follows: I a linear open addressed hash table with your preferred hash function; and ii) a sorted list.Using a) hashing and b) searching, find a list of keys on the representations I and ii). b) binary search, and so on. Compare the performance of the two methods across the entire list L.
2.1 Hashing With ChainingWe search/insert/delete in a hashtable in the following way. First use the getHashValue methodto get the hash value. Now use this hash value to get hold of a hash table entry, which is a linkedlist. These functions have been written and you do not need to modify them:• gethashValue: Uses the hash function (37 ∗ val + 61)%T ABLE SIZE.• getList: The hashtable is an array of linked list. So, this method simply returns the linkedlist at a particular index of the hash table. We will use the inbuilt linked-list of C++ or Java. This is an implementation of a doubly-linked-list (with links going both forward and backward). It supports all the standard operations (inserting at front or end, deleting head or tail, traversing the list, etc.) In the next sections (Java), I’ll highlight some of the usages (not all may be required). Since we will deal with integers,I will only discuss integer linked lists, but lists of any type can be created. 2.3 Java• Syntax to create an…
I am trying to implement a hash table of key-value pairs, where the key determines the location of the pair in the hash table, the key is what the hash function is used on. The hash table that I am trying to implement will use separate chaining (with unordered linked lists) for collision resolution. I need help changing the code where: 1. The "search" method of the code returns the node that was found or "None" 2. The "Node" implementation has a "key" and "value" member This is what I have so far class Node: def __init__(self,initdata): self.data = initdata self.next = None def getData(self): return self.data def getNext(self): return self.next def setData(self,newdata): self.data = newdata def setNext(self,newnext): self.next = newnext class UnorderedList: def __init__(self): self.head = None def isEmpty(self): return self.head == None def add(self,item): temp = Node(item) temp.setNext(self.head)…
2. Implement the hash table for the following elements: a. 22,32,45,67,89,9 Use Double hashing technique to handle the collision. [ hash1(key)=key%10, hash2(key)=PRIME- (key%PRIME) ].
JAVA 1-Write an application using a hash table that finds all the pairs of two integers within the below array that add up to 12.Array = {4,9,6,13,5,3,2,8} 2-Develop an application that stores characters A, B and C in a queue array and then displays both the size and the first-in element of the stack. The application should then remove the first element of the queue and then display both the size and the first-in element of the queue again. Appropriate queue methods should be used to add, delete and display characters. 3-Develop an application that store characters A, B and C in a stack array and then displays both the size and the last-in element of the stack. The application should then remove the last element of the stack and then display again both the size and the last-in element of the stack. Appropriate stack methods should be used to add, delete and display characters. 4-Write a program that merges two ordered-list objects of integers into a single ordered list object of…
JAVA PROGRAMMING Q4.1: You have two sequences of mutually-comparable items to sort: The sequences are identical in terms of their sizes, their items, and the current (unsorted) order of those items. One sequence is in an array and the other is in a linked list. For the array and the link list, make an argument for why the quick sort would be best for one and the merge sort for the other. In the identified situation, give a quantitative answer based on big-O and other technical factors, not just a qualitative answer. Address the specifics of the two algorithms -- their operations, time efficiency, money use, etc. Assume no optimization Q4.2: Explain and/or illustrate the specific changes made in each pass of an Insertion Sort on the following data: 47 4 22 13 9 12