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. Useh1(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 consequently ends your program. Note: for each performed operation above, you need to print the Hash table or show information from the hash table to demonstrate that such requested operation was successful. Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. Due date for this assignment is during the 12th Week of the Semester on
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. Useh1(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 consequently ends your program. Note: for each performed operation above, you need to print the Hash table or show information from the hash table to demonstrate that such requested operation was successful. Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples. Due date for this assignment is during the 12th Week of the Semester on
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
i need the answer quickly
![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
consequently ends your program. Note: for
each performed operation above, you need
to print the Hash table or show information
from the hash table to demonstrate that
such requested operation was successful.
Your final submitted code and report should
include some sample results that demonstrate
that your code is successfully and correctly
working. You need to present 3 samples.
Due date for this assignment is during the
12th Week of the Semester on](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F833d680f-2016-4fb1-bfa2-1762368deb73%2F6dd2c4ea-5607-4bd8-9312-126ff7bf9dca%2F5rzueu59_processed.jpeg&w=3840&q=75)
Transcribed Image Text: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
consequently ends your program. Note: for
each performed operation above, you need
to print the Hash table or show information
from the hash table to demonstrate that
such requested operation was successful.
Your final submitted code and report should
include some sample results that demonstrate
that your code is successfully and correctly
working. You need to present 3 samples.
Due date for this assignment is during the
12th Week of the Semester on
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 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