Home - LBeghini/Hash-Functions GitHub Wiki
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| H | A | S | H | - | F | U | N | C | T | I | O | N | S |
Hash Functions is an application developed for an assignment of a Discrete Mathematics class, with the goal of deepening the knowledege on the general subject. First, the subject was aproached in the form of theory studies and then, in a practical manner. The main purpouse of the application is to implement the basic functioning of hash functions.
System Specifications
These specifications was given from the teacher of the Discrete Mathematics class. It was originally written in portuguese. This is an open translation.
Build a program that, from an integer key k, performs insertion, search and removal in a hash table. The universe of keys must be a configurable parameter, as well as the size of the hash table. The program must interact with the user, informing when there was a collision and what action was taken. For small instances, a visual display on screen should be used.
Parameters entered at the beginning of the program by the user:
- universe of keys
- table size
- increment parameter (if applicable)
Collision handling must be done according to the technique:
Linear Probing two directions
The technique of marking the position with "A" (Available) can be used.
When removing, you can delete all of them in a sequence and then re-include them.
"Fixing up" everything at the time of exclusion generates a "plus" in the note.