- Forum
- General C++ Programming
- hashing
hashing
Hi everyone, I need some help in homework lab
Purpose: Use Hashing Techniques
Create a ADT to handle the data in the Customer.csv data file: (last,first,id)
perez,diana,86824983-3587182
oxford,greg,49451687-6884854
smith,tsung,34722447-9802850
Place each ADT data object into a Hashing structure using a custom hashing function. Demonstrate you can hash the name data as key and id as value, and visa versa. One of the Keys or Values to the hash structure is required to be an ADT type. This will require overloading appropriate operators (in C++) to support the < operator.
Write a hashing function that produces (ideally) a maximum of 5% collisions. Also, ideally, your space usage should be around 75% of the container.
Purpose: Use Hashing Techniques
Create a ADT to handle the data in the Customer.csv data file: (last,first,id)
perez,diana,86824983-3587182
oxford,greg,49451687-6884854
smith,tsung,34722447-9802850
Place each ADT data object into a Hashing structure using a custom hashing function. Demonstrate you can hash the name data as key and id as value, and visa versa. One of the Keys or Values to the hash structure is required to be an ADT type. This will require overloading appropriate operators (in C++) to support the < operator.
Write a hashing function that produces (ideally) a maximum of 5% collisions. Also, ideally, your space usage should be around 75% of the container.
What is the question you had? "Help" is a little vague as to what you didn't understand.
The question is odd, as ideally, you would have 0 collisions until you start having many millions of records and being a tightwad with space is annoying but the question seems otherwise to be straightforward.
The question is odd, as ideally, you would have 0 collisions until you start having many millions of records and being a tightwad with space is annoying but the question seems otherwise to be straightforward.
Topic archived. No new replies allowed.