1. Create an empty hash map named programs that will handle keys and values that are both of String type. 2. Map the following pairs: BSIT – Bachelor of Science in Information Technology BSCS – Bachelor of Science in Computer Science • BSIS – Bachelor of Science in Information Systems 3. Display the keys in a single line. 4. Delete the first entry. 5. Check whether the map contains the key "BSCPE".

1. Create an empty hash map named programs that will handle keys and values that are both of String type. 2. Map the following pairs: BSIT – Bachelor of Science in Information Technology BSCS – Bachelor of Science in Computer Science • BSIS – Bachelor of Science in Information Systems 3. Display the keys in a single line. 4. Delete the first entry. 5. Check whether the map contains the key "BSCPE".

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

fast please c++ Insert the elements of A in hash table H of size 10. H is a vector of int is size 10. Do not allow duplicates. Draw the table. The hash function is the number itself; f(n) = n%10
#7. HashTable Data Type: By having each bucket contain a linked list of elements that are hashed to that bucket. Usage: >>> table = SeparateChainingHashTable() # Create a new, empty map. >>> table.put('hello', 'world') # Add a new key-value pair. >>> len(table) # Return the number of key-value pairs stored in the map. 1 >>> table.get('hello') # Get value by key. 'world' >>> del table['hello'] # Equivalent to `table.del_('hello')`, deleting key-value pair. >>> table.get('hello') is None # Return `None` if a key doesn't exist. True """ _empty = None def __init__(self, size=11): self.size = size self._len = 0 self._table = [self._empty] * size def put(self, key, value): hash_ = self.hash(key) node_ = self._table[hash_] if node_ is self._empty: self._table[hash_] = Node(key, value) else: while node_.next is not None:…
mplement a hash table for strings. Create two hashing functions. It is up to you which type of chaining/probing you use. Add several (>10) strings to the hash table and display the table. Repeat this using a second, different hash function on the same strings. You should make your own hash functions.
(Java) (data structure) write an entire generic hashing program with a custom hashcode function and a Test class all classes should be generic and the program should have these methods : 1. rehash (to rehash when the array is 0.75 full) 2. rehash insert ( to insert items from the old array to the new larger one) 3. put (to insert into the hashtable) 4.getAll(to get all the items on the table you should override toString) 5. delete (to delete an item from the table) 6. custom hashcode function for T type
Computer Science Within a Java class, write a method that creates n random strings of length 10 and inserts them in a hash table. The method should compute the average time for each insertion. provide code and output.
C++ Complete the program that will allow the user to enter data on 10 Halloween costumes. The program will create Costume objects and then store the Costume objects in a Hash Table. The Costume ID will be the key and a pointer to the Costume object will be the value. You are given Lab7.cpp, HashEntry.h, and Costume.h and you should not have to make any changes to these files at all. You will need to write HashTable.h, which implements the HashTable class. This should NOT be a template class. Your HashTable class should resolve collisions by linear probing and should use the HashEntry class for the linkedlist nodes. Because we’re using probing, there is no removal function. This is okay for this application, since we want to keep a record of costumes that are no longer being kept in stock. ---GIVEN--- Lab.cpp #include <iostream> #include "HashTable.h" #include "Costume.h" using namespace std; int main() { int size; int key; Costume *newCostume; string name; float price;…
C++ Quadratic Probing: You have a file called athletes.txt Jamie, basketball Justine, soccer Ned, badminton Shelley, hopscotch etc... The file contains 9 athletes. The user will specify the size of the hash table. Write a function that keeps track of the total number of collisions and searches into the hash table. Each index is assigned hash_index = i % table_size where "i" is an int in a for loop up to table_size If the table is full then: int t = (hash_index + i* i) % table_size; Display the number of collisions and searches.
' make a hashmap ' import hashlib import sys def insert (hashmap, key, value): ' insert a key value pair into the hashmap ' hashmap[key] = value def remove (hashmap, key): ' remove a key value pair from the hashmap ' del hashmap[key] def search (hashmap, key): ' search for a key in the hashmap ' if key in hashmap: return hashmap[key] else: return None def print (hashmap): ' print the hashmap ' for key in hashmap: print (key, ":", hashmap[key]) 'end of print' def main (): 'make a menu that lets the user call the functions' hashmap = {} while True: print (""" Menu: 1. Insert 2. Remove 3. Search 4. Print 5. Quit """) choice = input ("Enter your choice: ") if choice == "1": key = input ("Enter the key: ") value = input ("Enter the value: ") insert (hashmap, key, value) elif choice == "2":…
Create a system that will allow a user to add and remove vehicles from an inventory system. Vehicles will be represented by license number (an eight-character string), make, model, and color. Use your own array-based implementation of a hash table using chaining.
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…
in c++ Create a student hash table that contains information, studentID (int), name (string), marks_oop345 (float). The size of hash table is equal to the number of students in the class. Use linear probing in case of collisions. Perform insertion, deletion, display and search operations.
In java Create a hash table using an array with elements 324,221,563,679,234,569,890,5678,654 then perform the following operations. 1) Insert 227 2) Delete 679 and Insert 9 3) Insert 67 4) Display the hash table content Note: This hash table uses technique linear probing when encounters a collision.