C++: Using the code in image:1. Write your own main and insert function to insert the sequence of integers { 138, 99, 16, 134, 42, 0, 6, 9, 4, 53, 47, 66) using a table of size 17.2.Implement your own rehashing algorithm of choice and run the same sequence of input using a table of size 7. #includeconst int TABLE_SIZE = 17;class HashMap {private:HashEntry *table;HashMap() {public:}table = new HashEntry* [TABLE_SIZE];for (int i = 0; i < TABLE_SIZE; i++)table[i] == NULL;int get(int key) {int hash = (key % TABLE_SIZE);while (table[hash] != NULL && table[hash]->getKey() != key)hash= (hash + 1) % TABLE_SIZE;if (table[hash] == NULL)return -1;return table[hash]->getValue();elsevoid insert(int value) {int hash= (value % TABLE_SIZE);if (get (value) == -1){table.push_back (value);}else if (get (value) != -1){table[hash]->getValue()->value;}-HashMap() {for (int i = 0; i < TABLE_SIZE; i++)if (table[i] != NULL)delete table[i];delete[] table;};int main(int argc, const char * argv[])HashMap Kirsten;Kirsten.insert (12);

The algorithm of code 1:- 1. Declare a class HashEntry to store the key-value pairs.2. Declare a…

Answered: #include const int TABLE SIZE = 17;…

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

Related questions

Concept explainers

Question

C++: Using the code in image:

1. Write your own main and insert function to insert the sequence of integers { 138, 99, 16, 134, 42, 0, 6, 9, 4, 53, 47, 66) using a table of size 17.

2.Implement your own rehashing algorithm of choice and run the same sequence of input using a table of size 7.

#include<iostream>
const int TABLE_SIZE = 17;
class HashMap {
private:
HashEntry *table;
HashMap() {
public:
}
table = new HashEntry* [TABLE_SIZE];
for (int i = 0; i < TABLE_SIZE; i++)
table[i] == NULL;
int get(int key) {
int hash = (key % TABLE_SIZE);
while (table[hash] != NULL && table[hash]->getKey() != key)
hash= (hash + 1) % TABLE_SIZE;
if (table[hash] == NULL)
return -1;
return table[hash]->getValue();
else
void insert(int value) {
int hash= (value % TABLE_SIZE);
if (get (value) == -1){
table.push_back (value);
}
else if (get (value) != -1){
table[hash]->getValue()->value;
}
-HashMap() {
for (int i = 0; i < TABLE_SIZE; i++)
if (table[i] != NULL)
delete table[i];
delete[] table;
};
int main(int argc, const char * argv[])
HashMap Kirsten;
Kirsten.insert (12);

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 8 steps with 8 images

SEE SOLUTION Check out a sample Q&A here

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