In this problem, you will implement a data structure for hashing with linear probing. Assume that we have functions for insertions, deletions, and finds. Define four functions as per description. Assume the keys are non-negative integers, which are hashed into a table of size maxSize. An empty table entry can be indicated using -2. Use -1 in a location to indicate that the entry formerly in the location has been deleted. Use hash function key%20. a. Find(x) which returns the index of where x is stored if it is in the hash table and -1 otherwise. b. Insert(x) which inserts x into the hash table with the precondition that x is not currently in the table. Naturally, a location with a -1 in it can be used to place a newly inserted item. Your algorithm should indicate when the hash table is full and x cannot be inserted. c. Delete(x) which removes x from the hash table using lazy deletion. d. Print) which prints all the valid items in the hash table. e. Rehash() which returns a new table of the same size max Size which contains all the items of the old table, but has no items marked as deleted. [Hint. Create a new object of HashTable, insert all the valid items from the current HashTable to the newly created one].
In this problem, you will implement a data structure for hashing with linear probing. Assume that we have functions for insertions, deletions, and finds. Define four functions as per description. Assume the keys are non-negative integers, which are hashed into a table of size maxSize. An empty table entry can be indicated using -2. Use -1 in a location to indicate that the entry formerly in the location has been deleted. Use hash function key%20. a. Find(x) which returns the index of where x is stored if it is in the hash table and -1 otherwise. b. Insert(x) which inserts x into the hash table with the precondition that x is not currently in the table. Naturally, a location with a -1 in it can be used to place a newly inserted item. Your algorithm should indicate when the hash table is full and x cannot be inserted. c. Delete(x) which removes x from the hash table using lazy deletion. d. Print) which prints all the valid items in the hash table. e. Rehash() which returns a new table of the same size max Size which contains all the items of the old table, but has no items marked as deleted. [Hint. Create a new object of HashTable, insert all the valid items from the current HashTable to the newly created one].
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![2. Operations on Hash Tables
In this problem, you will implement a data structure for hashing with linear probing. Assume
that we have functions for insertions, deletions, and finds. Define four functions as per
description. Assume the keys are non-negative integers, which are hashed into a table of size
maxSize. An empty table entry can be indicated using -2. Use -1 in a location to indicate that
the entry formerly in the location has been deleted. Use hash function key%20.
a. Find(x) which returns the index of where x is stored if it is in the hash table and -1
otherwise.
b. Insert(x) which inserts x into the hash table with the precondition that x is not currently in
the table. Naturally, a location with a -1 in it can be used to place a newly inserted item.
Your algorithm should indicate when the hash table is full and x cannot be inserted.
c. Delete(x) which removes x from the hash table using lazy deletion.
d. Print) which prints all the valid items in the hash table.
e. Rehash() which returns a new table of the same size maxSize which contains all the items
of the old table, but has no items marked as deleted. [Hint. Create a new object of
HashTable, insert all the valid items from the current HashTable to the newly created one].
CodeBlocks Details
Project Name: AsnHashDemo
Files: HashTable.h HashTable.cpp main.cpp](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe54f9e9d-cf63-4654-a164-a17d90b30853%2F3d008b83-704f-4df4-b3da-78c10b460bb7%2Fsys9k6b_processed.jpeg&w=3840&q=75)
Transcribed Image Text:2. Operations on Hash Tables
In this problem, you will implement a data structure for hashing with linear probing. Assume
that we have functions for insertions, deletions, and finds. Define four functions as per
description. Assume the keys are non-negative integers, which are hashed into a table of size
maxSize. An empty table entry can be indicated using -2. Use -1 in a location to indicate that
the entry formerly in the location has been deleted. Use hash function key%20.
a. Find(x) which returns the index of where x is stored if it is in the hash table and -1
otherwise.
b. Insert(x) which inserts x into the hash table with the precondition that x is not currently in
the table. Naturally, a location with a -1 in it can be used to place a newly inserted item.
Your algorithm should indicate when the hash table is full and x cannot be inserted.
c. Delete(x) which removes x from the hash table using lazy deletion.
d. Print) which prints all the valid items in the hash table.
e. Rehash() which returns a new table of the same size maxSize which contains all the items
of the old table, but has no items marked as deleted. [Hint. Create a new object of
HashTable, insert all the valid items from the current HashTable to the newly created one].
CodeBlocks Details
Project Name: AsnHashDemo
Files: HashTable.h HashTable.cpp main.cpp
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
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY