Write a complete C++ program that implements an open addressing Hash Table Let the size of the keys n be a user specified input. Consequently, let the size of the Table m to be set as 3/2 n. You code: • needs to support the search, insert and delete operations. • must use the delete marker idea to efficiently deal with the delete operation. • needs to ask the user to enter the total number of keys to be inserted n. • needs to set m to equal 3/2 n. • should generate the n keys randomly in the range [1,..., 100000] and print them. • must use the double hashing collision resolution method. Use h1(k) = k mod m h2(k)=R-k mod R, where R is a generated prime number that is just less than m. You should print these functions. • must insert all the randomly generated keys. Your code must calculate and print the total number of collisions while inserting the keys. • must provide a menu to the user that allows to perform some additional operations like inserting new key, delete a key or searching for certain key until the user choose to quit such menu and

Write a complete C++ program that implements an open addressing Hash Table Let the size of the keys n be a user specified input. Consequently, let the size of the Table m to be set as 3/2 n. You code: • needs to support the search, insert and delete operations. • must use the delete marker idea to efficiently deal with the delete operation. • needs to ask the user to enter the total number of keys to be inserted n. • needs to set m to equal 3/2 n. • should generate the n keys randomly in the range [1,..., 100000] and print them. • must use the double hashing collision resolution method. Use h1(k) = k mod m h2(k)=R-k mod R, where R is a generated prime number that is just less than m. You should print these functions. • must insert all the randomly generated keys. Your code must calculate and print the total number of collisions while inserting the keys. • must provide a menu to the user that allows to perform some additional operations like inserting new key, delete a key or searching for certain key until the user choose to quit such menu and

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

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. .
TOKEN is a priority queue for organizing n data items with m priority numbers.TOKEN is implemented as a two-dimensional array TOKEN[1:m, 1:p], where p isthe maximum number of elements with a given priority. Execute the followingoperations on TOKEN [1:3, 1:2]. Here, INSERT(“xxx”, m) indicates the insertion ofitem “xxx” with priority number m, and DELETE() indicates the deletion of the firstamong the high priority items.i) INSERT(“not”, 1)ii) INSERT(“and”, 2)iii) INSERT(“or”, 2)iv) DELETE()v) INSERT (“equ”, 3)
Student should be able to develop the programs for stack using arrays and linked list By using C++ software| Write a C++ program that reads a data file consisting of each student's GPA followed by the student's name. The program then prints the highest GPA and the names of all the students who received that GPA. The program scans the input file only once. Moreover, we assume that there are a maximum of 100 students in the class. INPUT The program reads an input file consisting of each student's GPA, followed by the Student's name. Sample data is as follows: 3.5 Baharom 3.6 Jason 2.7 Lisa 3.9 Khadijah 3.4 Jamal 3.9 Davendren 3.4 Termizi OUTPUT The program outputs the highest GPA and all the names associated with the highest GPA. For example, for the preceding data, the highest GPA is 3.9 and the students with that GPA are Khadijah and Davendren.
PYTHON Why am I getting an error and it doesn't show the right output? Problem 1# Implement a hashtable using an array. Your implementation should include public methods for insertion, deletion, and# search, as well as helper methods for resizing. The hash table is resized when the loadfactor becomes greater than 0.6# during insertion of a new item. You will be using linear probing technique for collision resolution. Assume the key to# be an integer and use the hash function h(k) = k mod m where m is the size of the hashtable. class HashTableProb: def __init__(self, size=10): # Initialize the hashtable with the given size and an empty array to hold the key-value pairs. self.__size = size # size of the hashtable self.__hashtable = [None for _ in range(size)] self.__itemcount = 0 # Keeps track of the number of items in the current hashtable def __contains__(self, key): return self.__searchkey(key) def __next_prime(self, x): def…
8)A college has 5 departments, the total intake of each departments are 60, 76, 45, 80, 62 Use a sort technique that works by repeatedly stepping through the above intake values, and then enqueue the elements in a queue, one after another and display them.
A group of students writes their names and unique student ID numbers on sheets of paper. The sheets are then randomly placed in a stack. Their teacher is looking to see if a specific ID number is included in the stack. Which of the following best describes whether their teacher should use a linear or a binary search? a. The teacher could use either type of search though the binary search is likely to be faster b. The teacher could use either type of search though the linear search is likely to be faster c. Neither type of search will work since the data is numeric d. Only the linear search will work since the data has not been sorted
Given array A = [514, 650, 174, 559, 649, 155, 200, 255, 520, 380]. Do the following tasks. a. Create an auxiliary array AUX. Use the hash function hash(element) to help yourself. Element refers to the elements in array A. def hash (element) : index = summation of each digit of (element 8 100) 810 return index [Don't write code for part a. You have to draw and show calculations if there are any] b. Complete the function find(A, AUX, key) that returns the frequency [number of times found] if key is found in A else return -1
Program 12_2.java Write a program that creates a small (6-10) array of ints. Display your array elements, all on one line, using a foreach loop. In a try block, prompt the user to enter an index for the array and attempt to print the element with that index. Follow the try block with two catch blocks; one that detects an index out of bounds, and another that catches other bad inputs. See Sample Runs below. Sample Run 112 15 24 5 9 16 Enter any index of your array 5 Element at index 5 is 16 Sample Run 212 15 24 5 9 16 Enter any index of your array 9 Error. Array index was out of bounds Sample Run 312 15 24 5 9 16 Enter any index of your array three Bad input. Try again
Execute an online dictionary (with a limited list of words) which makes use ofinterpolation search to search through the dictionary given a word. Refine theprogram to correct any misspelled word with the nearest and/or the correct wordfrom the dictionary.
Use C/C++ Write a program to store n integers in a chained hash table of 9 memory locations. Use h(k) = k mod n. The program can do jobs as follows: a) Add a number to the table. b) Print out the hash table. c) Search for a given value. d) Remove a number from the hash table.
Execute an online dictionary (with a limited list of words) which makes use ofinterpolation search to search through the dictionary given a word. Refine theprogram to correct any misspelled word with the nearest and/or the correct wordfrom the dictionary.
Write a C++ program that: (1) defines and implements a hash class that constructs a 15 element array (may be implemented using a vector, a deque, or a list, if you prefer), storing strings, using the following hash function: ((first_letter) + (second_letter) + (last_letter))% 15 (2) the driver program should: a. query the user for ten words and store them using the hash technique described above. b. print out the contents of each position of the array (or vector, deque, or whatever you used), showing vacant as well as filled positions. Remember, only 10 of the 15 positions will be filled. c. repeatedly query the user for a target word, hash the word, check for its inclusion in the list of stored words, and report the result. Continue doing this task until the user signals to stop (establish a sentinel condition).