public:t-622-arti-15-1:lab_2_-_hashing_states
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| public:t-622-arti-15-1:lab_2_-_hashing_states [2015/01/21 09:25] – stephan | public:t-622-arti-15-1:lab_2_-_hashing_states [2024/04/29 13:33] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 12: | Line 12: | ||
| - Which data structure is typically used for detecting repeated states and why? | - Which data structure is typically used for detecting repeated states and why? | ||
| - Download the material below, implement a hash function for State objects that passes all the tests. | - Download the material below, implement a hash function for State objects that passes all the tests. | ||
| - | - Report and comment on the results you get. How many hash collisions and bucket index collisions do you get? | + | - Report and comment on the results you get. How many hash collisions and bucket index collisions do you get? Is this good or bad? (If the results are bad try to improve your hash function. If you only get very few collisions, increase the number of states that are generated in Main.java to 10000 or 100000 and see what happens.) |
| - | Is this good or bad? (If the results are bad try to improve your hash function. If you only get very few collisions, increase the number of states that are generated in Main.java to 10000 or 100000 and see what happens.) | + | |
| - Why is it important to have few hash collisions if hashing is used to detect repeated states? | - Why is it important to have few hash collisions if hashing is used to detect repeated states? | ||
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-15-1/lab_2_-_hashing_states.1421832308.txt.gz · Last modified: 2024/04/29 13:32 (external edit)