The NIRVANA HILTON contains 100 rooms. We wish to create a hotel register that can be used to access each occupant by name with a minimum amount of searching. We also wish to keep track of all occupants by room number.
Assignment: Write a C++ program to accomplish the above objectives using the following techniques:
1. Construct a hash table with a load factor near 90%. For this problem, use a table of 114 elements with subscripts ranging from 0 to 113.
2. Resolve collisions by chaining.
3. Maintain a chain of empty table positions.
4. Use an array of tags to access occupants by room number.
5. Maintain necessary counters to compute the following at the end of the run:
a) probes per successful search
b) probes per unsuccessful search
c) probes per search (overall)
6) Use the names given in this handout to initially fill up the hotel. (may be in any order desired)
7) Use the action requests given in this handout as the action input cards to your program. These cards must be input to your program in the same order they are listed in this handout.
8) You must submit flowcharts with your program. The logic involved in maintaining the chains in the hash table can be quite tricky, if you write your flowchart first, you may save yourself a lot of agony when you begin testing your program.