#include const int TABLE SIZE = 17; class HashMap { private: HashEntry *table; HashMap() { public: } } int } table = new HashEntry* [TABLE_SIZE]; for (int i = 0; i < TABLE_SIZE; i++) table[i] == NULL; get (int key) { int hash= (key % TABLE_SIZE); while (table[hash] != NULL && table[hash]->getKey() != key) hash = (hash +1)% TABLE_SIZE; NULL) } if (table[hash] 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);
#include const int TABLE SIZE = 17; class HashMap { private: HashEntry *table; HashMap() { public: } } int } table = new HashEntry* [TABLE_SIZE]; for (int i = 0; i < TABLE_SIZE; i++) table[i] == NULL; get (int key) { int hash= (key % TABLE_SIZE); while (table[hash] != NULL && table[hash]->getKey() != key) hash = (hash +1)% TABLE_SIZE; NULL) } if (table[hash] 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);
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
Related questions
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
![#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);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fcb3b4814-c631-486e-b868-46cfd98a6eb6%2F3e4d8319-d0e3-40ac-a720-4b74fb555b72%2F57z4r0s_processed.png&w=3840&q=75)
Transcribed Image Text:#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

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 8 steps with 8 images

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.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education